Multirobot Symbolic Planning under Temporal Uncertainty
نویسندگان
چکیده
Multirobot symbolic planning (MSP) aims at computing plans, each in the form of a sequence of actions, for a team of robots to achieve their individual goals while minimizing overall cost. Solving MSP problems requires modeling limited domain resources (e.g., corridors that allow at most one robot at a time) and the possibility of action synergy (e.g., multiple robots going through a door after a single door-opening action). However, the temporal uncertainty that propagates over actions, such as delays caused by obstacles in navigation actions, makes it challenging to plan for resource sharing and realizing synergy in a team of robots. This paper, for the first time, introduces the problem of MSP under temporal uncertainty (MSPTU). We present a novel, iterative inter-dependent planning (IIDP) algorithm, including two configurations (simple and enhanced), for solving general MSPTU problems. We then focus on multirobot navigation tasks, presenting a full instantiation of IIDP that includes a new algorithm for computing conditional plan cost under temporal uncertainty and a novel shifted-Poisson distribution for accumulating temporal uncertainty over actions. The algorithms have been implemented both in simulation and on real robots. We observed a significant reduction in overall cost compared to baselines in which robots do not communicate or model temporal uncertainty.
منابع مشابه
Auctioning over Probabilistic Options for Temporal Logic-Based Multi-Robot Cooperation under Uncertainty
Coordinating a team of robots to fulfill a common task is still a demanding problem. This is even more the case when considering uncertainty in the environment, as well as temporal dependencies within the task specification. A multirobot cooperation from a single goal specification requires mechanisms for decomposing the goal as well as an efficient planning for the team. However, planning acti...
متن کاملSubdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning
Planning optimal paths for large numbers of robots is computationally expensive. In this thesis, we present a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded in...
متن کاملTemporal Constraints in Planning: Free or not Free ?
relating those decisional variables, thus making it possible to apply classical constraints propagation used in planning. Those meta-structures exist together with the classical time-points graph structures that are necessary at execution time, as we need to hold all the events (beginning and ending of tasks, instantaneous events). Lastly, it is important to notice that the different CSP struct...
متن کاملConditional Planning under Partial Observability as Heuristic-Symbolic Search in Belief Space
Planning under partial observability in nondeterministic domains is a very significant and challenging problem, which requires dealing with uncertainty together with and-or search. In this paper, we propose a new algorithm for tackling this problem, able to generate conditional plans that are guaranteed to achieve the goal despite of the uncertainty in the initial condition and the uncertain ef...
متن کاملApprentissage de règles associatives temporelles pour les séquences temporelles de symboles. (Learning temporal association rules on Symbolic time sequences)
The learning of temporal patterns is a major challenge of Data mining. We introduce a temporal pattern model called Temporal Interval Tree Association Rules (Tita rules or Titar). This pattern model can be used to express both uncertainty and temporal inaccuracy of temporal events. Among other things, Tita rules can express the usual time point operators, synchronicity, order, and chaining,disj...
متن کامل