A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A#: A distributed version of A* for factored planning
2012
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Factored planning consists in driving a modular or distributed system to a target state, in an optimal manner, assuming all actions are controllable. Such problems take the form of path search in a product of graphs. The state space of each component is a graph, in which one must find a path to the local goal of this component. But when all components are considered jointly, the problem amounts to finding a path in each of these state graphs, while ensuring their compatibility on the actions
doi:10.1109/cdc.2012.6426187
dblp:conf/cdc/JezequelF12
fatcat:mfdd4tbfufdafdoolyflqk5kee