The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
We investigate the application of a low-cost, pervasively distributed network to plan paths for mobile robots in environments with dynamic obstacles. We consider a heterogeneous s...
Much of the focus of the research effort in path planning for mobile robots has centred on the problem of finding a path from a start location to a goal location, while minimising...
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
Navigationalpath planning is a classicalproblem in autonomous mobile robotics. Most AI approachesto path planning use goal-directedheuristicsearch of problem spaces defined by spa...
Ashok K. Goel, Michael W. Donnellan, Nancy Vazquez...
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
Ulrich Roth, Marc Walker, Arne Hilmann, Heinrich K...
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
This paper introduces a novel heuristic nmdmap method for path planning, one that is inspired by the Vomnoi diagmm concept, but easiZy applicable to geneml configurntion spaces. T...
S. Sathiya Keerthi, Chong Jin Ong, Eugene Huang, E...
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...