Planning High-Level Paths in Hostile, Dynamic, and Uncertain Environments (original) (raw)
Journal of Artificial Intelligence Research
This paper introduces and studies a graph-based variant of the path planning problem arising in hostile environments. We consider a setting where an agent (e.g. a robot) must reach a given destination while avoiding being intercepted by probabilistic entities which exist in the graph with a given probability and move according to a probabilistic motion pattern known a priori. Given a goal vertex and a deadline to reach it, the agent must compute the path to the goal that maximizes its chances of survival. We study the computational complexity of the problem, and present two algorithms for computing high quality solutions in the general case: an exact algorithm based on Mixed-Integer Nonlinear Programming, working well in instances of moderate size, and a pseudo-polynomial time heuristic algorithm allowing to solve large scale problems in reasonable time. We also consider the two limit cases where the agent can survive with probability 0 or 1, and provide specialized algorithms to de...
Related papers
Robotic Path Planning for High-Level Tasks in Discrete Environments
2018
This thesis proposes two techniques for solving high-level multi-robot motion planning problems with discrete environments. We focus on an important class of problems that require an allocation of spatially distributed tasks to robots, along with a set of efficient paths for the robots to visit their task locations. The first technique, SAT-TSP, models the problem with a framework that allows a natural coupling between the allocation problem and the path planning problem. The allocation problem is encoded as a Boolean Satisfiability problem (SAT) and the path planning problem is encoded as a Travelling Salesman Problem (TSP). In addition, this framework can handle complex constraints such as battery life limitations, robot carrying capacities, and robot-task incompatibilities. We propose an algorithm that leverages recent advances in Satisfiability Modulo Theory to combine state-of-the-art SAT and TSP solvers. We characterize the correctness of our algorithm and evaluate it in simul...
Probabilistic Search and Pursuit Evasion on a Graph
This paper presents an approach to locate an adversarial, mobile evader in an indoor environment using motion planning of mobile pursuers. The approach presented in this paper uses motion planning of mobile robots to search a target in a graph and clear the workspace. The algorithm used is Partially Observable Markov Decision Process (POMDP), a probabilistic search method to clear the indoor workspace in a pursuit evasion domain. In this paper, the indoor environment is assumed to be known beforehand and the mobile evader to be adversarial with no motion model given. The workspace is first discretized and then converted to a graph, whose nodes represent the rooms and corridors and edges represent connection between them. The task of pursuer is to clear the whole graph with no contaminated node left in minimum possible steps. Such path planning problems are NP-hard and the problem scales exponentially with increased number of pursuers and complex graph.
Randomized path planning with preferences in highly complex dynamic environments
Robotica, 2013
SUMMARYIn this paper we consider the problem of planning paths for articulated bodies operating in workplaces containing obstacles and regions with preferences expressed as degrees of desirability. Degrees of desirability could specify danger zones and desire zones. A planned path should not collide with the obstacles and should maximize the degrees of desirability. Region desirability can also convey search-control strategies guiding the exploration of the search space. To handle desirability specifications, we introduce the notion of flexible probabilistic roadmap (flexible PRM) as an extension of the traditional PRM. Each edge in a flexible PRM is assigned a desirability degree. We show that flexible PRM planning can be achieved very efficiently with a simple sampling strategy of the configuration space defined as a trade-off between a traditional sampling oriented toward coverage of the configuration space and a heuristic optimization of the path desirability degree. For path pl...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.