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 …

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 …

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 …

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 …

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 …

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 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 …

We consider the problem of graph searching with prediction recently introduced by Banerjee
et al.(2023). In this problem, an agent starting at some vertex r has to traverse a (potentially …

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 …

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 …