Online algorithms with advice: A survey
J Boyar, LM Favrholdt, C Kudahl, KS Larsen… - ACM Computing …, 2017 - dl.acm.org
In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …
irrevocable manner before the next request arrives. Online algorithms with advice is an area …
UAV-assisted wireless localization for search and rescue
In the aftermath of disasters, localization of trapped victims is imperative to ensure their
safety and rescue. This article presents a novel localization and path planning approach that …
safety and rescue. This article presents a novel localization and path planning approach that …
[PDF][PDF] Geometric Shortest Paths and Network Optimization.
JSB Mitchell - Handbook of computational geometry, 2000 - Citeseer
A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …
Spiral-STC: An on-line coverage algorithm of grid environments by a mobile robot
Y Gabriely, E Rimon - … on Robotics and Automation (Cat. No …, 2002 - ieeexplore.ieee.org
We describe an on-line sensor based algorithm for covering planar areas by a square-
shaped tool attached to a mobile robot. Let D be the tool size. The algorithm, called Spiral …
shaped tool attached to a mobile robot. Let D be the tool size. The algorithm, called Spiral …
Algorithms for the On-Line Travelling Salesman 1
In this paper the problem of efficiently serving a sequence of requests presented in an on-
line fashion located at points of a metric space is considered. We call this problem the On …
line fashion located at points of a metric space is considered. We call this problem the On …
On-line searching and navigation
P Berman - Online Algorithms: The State of the Art, 2005 - Springer
In this chapter we review problems where an algorithm controls movements of an agent (eg
a robot) in an unknown environment, and receives the sensory inputs of the agent, which …
a robot) in an unknown environment, and receives the sensory inputs of the agent, which …
Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms
NSV Rao, S Kareti, W Shi, SS Iyengar - 1993 - osti.gov
A formal framework for navigating a robot in a geometric terrain by an unknown set of
obstacles is considered. Here the terrain model is not a priori known, but the robot is …
obstacles is considered. Here the terrain model is not a priori known, but the robot is …
Online routing problems: Value of advanced information as improved competitive ratios
We consider online versions of the traveling salesman problem (TSP) and traveling
repairman problem (TRP) where instances are not known in advance. Cities (points) to be …
repairman problem (TRP) where instances are not known in advance. Cities (points) to be …
Robustification of online graph exploration methods
Exploring unknown environments is a fundamental task in many domains, eg, robot
navigation, network security, and internet search. We initiate the study of a learning …
navigation, network security, and internet search. We initiate the study of a learning …
Competitive on-line coverage of grid environments by a mobile robot
Y Gabriely, E Rimon - Computational Geometry, 2003 - Elsevier
We describe in this paper two on-line algorithms for covering planar areas by a square-
shaped tool attached to a mobile robot. Let D be the tool size. The algorithms, called …
shaped tool attached to a mobile robot. Let D be the tool size. The algorithms, called …