Planning under Uncertainty for Coordinating Infrastructural Maintenance

We address efficient planning of maintenance activities in infrastructural networks, inspired by the real-world problem of servicing a highway network. A road authority is responsible for the quality, throughput and maintenance costs of the network, while the actual maintenance is performed by autonomous, third-party contractors. From a (multi-agent) planning and scheduling perspective, many interesting challenges can be identified. First, planned maintenance activities might have an uncertain duration due to unexpected delays. Second, since maintenance activities influence the traffic flow in the network, careful coordination of the planned activities is required in order to minimise their impact on the network throughput. Third, as we are dealing with selfish agents in a private-values setting, the road authority faces an incentive-design problem to truthfully elicit agent costs, complicated by the fact that it needs to balance multiple objectives. The main contributions of this work are: 1) multi-agent coordination on a network level through a novel combination of planning under uncertainty and dynamic mechanism design, applied to real-world problems, 2) accurate modelling and solving of maintenance-planning problems and 3) empirical exploration of the complexities that arise in these problems. We introduce a formal model of the problem domain, present experimental insights and identify open challenges for both the planning and scheduling as well as the mechanism design communities.

[1]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[2]  Michael Rovatsos,et al.  Scaling Up Multiagent Planning: A Best-Response Approach , 2011, ICAPS.

[3]  Ronen I. Brafman,et al.  Planning Games , 2009, IJCAI.

[4]  Matthijs T. J. Spaan,et al.  Planning under Uncertainty for Coordinating Infrastructural Maintenance (abstract) , 2013, BNAIC 2013.

[5]  Boris Detienne,et al.  Scheduling jobs on parallel machines to minimize a regular step total cost function , 2011, J. Sched..

[6]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

[7]  Craig Boutilier,et al.  Planning, Learning and Coordination in Multiagent Decision Processes , 1996, TARK.

[8]  Carmine Ventre,et al.  Utilitarian Mechanism Design for Multiobjective Optimization , 2014, SIAM J. Comput..

[9]  Ilya Segal,et al.  An Efficient Dynamic Mechanism , 2013 .

[10]  Carmine Ventre,et al.  Utilitarian mechanism design for multi-objective optimization , 2010, SODA '10.

[11]  Moshe Tennenholtz,et al.  Fault tolerant mechanism design , 2008, Artif. Intell..

[12]  Neil Immerman,et al.  The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.

[13]  Yingqian Zhang,et al.  Of Mechanism Design and Multiagent Planning , 2008 .

[14]  Ruggiero Cavallo,et al.  Efficiency and redistribution in dynamic mechanism design , 2008, EC '08.

[15]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[16]  C. d'Aspremont,et al.  Incentives and incomplete information , 1979 .

[17]  Yingqian Zhang,et al.  Of Mechanism Design Multiagent Planning , 2008, ECAI.

[18]  Kagan Tumer,et al.  Using Collective Intelligence to Route Internet Traffic , 1998, NIPS.

[19]  Sven Seuken,et al.  Partially Synchronized DEC-MDPs in Dynamic Mechanism Design , 2008, AAAI.

[20]  Nikos A. Vlassis,et al.  Utile Coordination: Learning Interdependencies Among Cooperative Agents , 2005, CIG.

[21]  Mathijs de Weerdt,et al.  Designing a dynamic network based approach for asset management activities , 2012 .

[22]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

[23]  D. Bergemann,et al.  Efficient Dynamic Auctions , 2006 .

[24]  David C. Parkes,et al.  Optimal Coordinated Planning Amongst Self-Interested Agents with Private State , 2006, UAI.

[25]  Manuela M. Veloso,et al.  Learning of coordination: exploiting sparse interactions in multiagent systems , 2009, AAMAS.