Skip to Main content Skip to Navigation
New interface
Conference papers

Distributed Optimal Planning: an Approach by Weighted Automata Calculus

Eric Fabre 1, * Loïg Jezequel 2 
* Corresponding author
1 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Eric Fabre Connect in order to contact the contributor
Submitted on : Wednesday, January 15, 2014 - 9:53:19 PM
Last modification on : Tuesday, March 8, 2022 - 11:50:02 AM
Long-term archiving on: : Saturday, April 8, 2017 - 5:00:50 PM


Files produced by the author(s)


  • HAL Id : hal-00931846, version 1


Eric Fabre, Loïg Jezequel. Distributed Optimal Planning: an Approach by Weighted Automata Calculus. 48th IEEE Conference on Decision and Control, Dec 2009, Shanghai, China. pp.211-216. ⟨hal-00931846⟩



Record views


Files downloads