Multi-agent, multi-objective path planning in complex environments

Path planning for autonomous missions often involves dynamic, uncertain and complex environments such as robots operating on planetary bodies, in underwater regions and in adverse weather conditions. Path planning in such conditions demands the use of control frameworks significantly different from the available methods for simple environments.\n\nIn the first part of the thesis, we consider a generalized problem of visiting a set of targets while avoiding some obstacles, but the location of targets and obstacles are a priori unknown. We present the environment as a labeled graph where the labels of states are initially unknown, and consider a motion planning objective to fulfill a combination of reach-avoid specifications given on these labels in minimum time. By describing the record of visited labels as an automaton, we translate our problem to a Canadian traveler problem on an adapted state space. We propose a strategy that exploits possible a priori knowledge about the labels and the environment and incrementally reveals the environment online. Namely, the agent plans, follows, and replans the optimal path by assigning edge weights that balance exploration and exploitation, given the current knowledge of the environment. We illustrate our strategy on the setting of an agent operating in a gridwold environment.\n\nIn the second part, we consider the problem of visiting a set of targets in minimum time by a single agent or a team of non-communicating agents in a complex environment with stochastic dynamics. We model the environment by a Markov decision process. First, for the single-agent case, we reduce our problem to a Hamiltonian path problem and show that it is at least NP-hard. Using Bellman's optimality equation, we present an optimal algorithm that is exponential in the number of target states. Then, we trade-off optimality for time complexity by presenting an algorithm that is polynomial at each time step. We prove that the proposed algorithm generates optimal policies for certain classes of Markov decision processes. \n\nFor the multi-agent case, we propose a heuristic partitioning procedure of assigning targets to agents that approximately minimizes the largest expected time to visit the target states. We prove that the heuristic procedure generates optimal partitions for clustered target states. We present the performance of our algorithms on random Markov decision processes and a grid world environment inspired by autonomous underwater vehicles operating in an ocean.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.