Distributed optimal planning: an approach by weighted automata calculus

We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal state in an optimal manner, assuming actions have a cost. To cope with the complexity of the system, we propose a distributed/modular planning approach. In each automaton or component, an agent explores local action plans that reach the local goal. The agents have to coordinate their search in order to select local plans that 1/ can be assembled into a valid global plan and 2/ ensure the optimality of this global plan. The proposed solution takes the form of a message passing algorithm, of peer-to-peer nature: no coordinator is needed. We show that local plan selections can be performed by combining operations on weighted languages, and then propose a more practical implementation in terms of weighted automata calculus.

[1]  Ronen I. Brafman,et al.  From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.

[2]  Eric Fabre.  Convergence of Turbo Algorithms for Systems Defined by Local Constraints , 2003 .

[3]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[4]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[5]  Jussi Rintanen,et al.  Planning via Petri Net Unfolding , 2007, IJCAI.

[6]  Eyal Amir,et al.  Factored Planning for Controlling a Robotic Arm : Theory , 2006 .

[7]  W. M. Wonham,et al.  Distributed diagnosis for qualitative systems , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[8]  Mehryar Mohri,et al.  Weighted Automata Algorithms , 2009 .

[9]  Patrik Haslum,et al.  Directed Unfolding of Petri Nets , 2008, Trans. Petri Nets Other Model. Concurr..

[10]  Yixin Chen,et al.  Fast Planning by Search in Domain Transition Graph , 2008, AAAI.

[11]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[12]  Yixin Chen,et al.  DTG-Plan : Fast Planning by Search in Domain Transition Graphs , 2008 .

[13]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[14]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[15]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[16]  Alan P. Parkes.  Finite State Transducers , 2008 .

[17]  Eyal Amir,et al.  Factored planning , 2003, IJCAI 2003.

[18]  Ronen I. Brafman,et al.  Factored Planning: How, When, and When Not , 2006, AAAI.