Goto

Collaborating Authors

 upmurphi


Embedding Automated Planning within Urban Traffic Management Operations

McCluskey, Thomas Leo (University of Huddersfield) | Vallati, Mauro (University of Huddersfield)

AAAI Conferences

This paper is an experience report on the results of an industry-led collaborative project aimed at automating the control of traffic flow within a large city centre. A major focus of the automation was to deal with abnormal or unexpected events such as roadworks, road closures or excessive demand, resulting in periods of saturation of the network within some region of the city. We describe the resulting system which works by sourcing and semantically enriching urban traffic data, and uses the derived knowledge as input to an automated planning component to generate light signal control strategies in real time. This paper reports on the development surrounding the planning component, and in particular the engineering, configuration and validation issues that arose in the application. It discusses a range of lessons learned from the experience of deploying automated planning in the road transport area, under the direction of transport operators and technology developers.


PDDL+ Planning with Temporal Pattern Databases

Piotrowski, Wiktor Mateusz (King's College London) | Fox, Maria (King's College London) | Long, Derek (King's College London) | Magazzeni, Daniele (King's College London) | Mercorio, Fabio (University of Milano-Bicocca)

AAAI Conferences

The introduction of PDDL+ allowed more accurate representations of complex real-world problems of interest to the scientific community. However, PDDL+ problems are notoriously challenging to planners, requiring more advanced heuristics. We introduce the Temporal Pattern Database (TPDB), a new domain-independent heuristic technique designed for PDDL+ domains with mixed discrete/continuous behaviour, non-linear system dynamics, processes, and events. The pattern in the TPDB is obtained through an abstraction based on time and state discretisation. Our approach combines constraint relaxation and abstraction techniques, and uses solutions to the relaxed problem, as a guide to solving the concrete problem with a discretisation fine enough to satisfy the continuous model's constraints.


Heuristic Planning for Hybrid Systems

Piotrowski, Wiktor Mateusz (King's College London) | Fox, Maria (King's College London) | Long, Derek (King's College London) | Magazzeni, Daniele (King's College London) | Mercorio, Fabio (University of Milan-Bicocca)

AAAI Conferences

Planning in hybrid systems has been gaining research interest in the Artificial Intelligence community in recent years. Hybrid systems allow for a more accurate representation of real world problems, though solving them is very challenging due to complex system dynamics and a large model feature set. We developed DiNo, a new planner designed to tackle problems set in hybrid domains.DiNo is based on the discretise and validate approach and uses the novel Staged Relaxed Planning Graph+ (SRPG+) heuristic.


Heuristic Planning for PDDL+ Domains

Piotrowski, Wiktor Mateusz (King's College London) | Fox, Maria (King's College London) | Long, Derek (King's College London) | Magazzeni, Daniele (King's College London) | Mercorio, Fabio (University of Milan-Bicocca)

AAAI Conferences

Planning with hybrid domains modelled in PDDL+ has been gaining research interest in the Automated Planning community in recent years. Hybrid domain models capture a more accurate representation of real world problems that involve continuous processes than is possible using discrete systems. However, solving problems represented as PDDL+ domains is very challenging due to the construction of complex system dynamics, including non-linear processes and events. In this paper we introduce DiNo, a new planner capable of tackling complex problems with non-linear system dynamics governing the continuous evolution of states. DiNo is based on the discretise-and-validate approach and uses the novel Staged Relaxed Planning Graph+ (SRPG+) heuristic, which is introduced in this paper. Although several planners have been developed to work with subsets of PDDL+ features, or restricted forms of processes, DiNo is currently the only heuristic planner capable of handling non-linear system dynamics combined with the full PDDL+ feature set.


Resource-Optimal Planning For An Autonomous Planetary Vehicle

Della Penna, Giuseppe, Intrigila, Benedetto, Magazzeni, Daniele, Mercorio, Fabio

arXiv.org Artificial Intelligence

Autonomous planetary vehicles, also known as rovers, are small autonomous vehicles equipped with a variety of sensors used to perform exploration and experiments on a planet's surface. Rovers work in a partially unknown environment, with narrow energy/time/movement constraints and, typically, small computational resources that limit the complexity of on-line planning and scheduling, thus they represent a great challenge in the field of autonomous vehicles. Indeed, formal models for such vehicles usually involve hybrid systems with nonlinear dynamics, which are difficult to handle by most of the current planning algorithms and tools. Therefore, when offline planning of the vehicle activities is required, for example for rovers that operate without a continuous Earth supervision, such planning is often performed on simplified models that are not completely realistic. In this paper we show how the UPMurphi model checking based planning tool can be used to generate resource-optimal plans to control the engine of an autonomous planetary vehicle, working directly on its hybrid model and taking into account several safety constraints, thus achieving very accurate results.


UPMurphi: A Tool for Universal Planning on PDDL+ Problems

Penna, Giuseppe Della (University of L'Aquila) | Magazzeni, Daniele (University of L'Aquila) | Mercorio, Fabio (University of L'Aquila) | Intrigila, Benedetto (University of Roma "Tor Vergata")

AAAI Conferences

Systems subject to (continuous) physical effects and controlled by (discrete) digital equipments, are today very common. Thus, many realistic domains where planning is required are represented by hybrid systems , i.e., systems containing both discrete and continuous values, with possibly a nonlinear continuous dynamics. The PDDL+ language allows one to model these domains, however the current tools can generally handle only planning problems on (possibly hybrid) systems with linear dynamics. Therefore, universal planning applied to hybrid systems and, in general, to non-linear systems is completely out of scope for such tools. In this paper, we propose the use of explicit model checking-based techniques to solve universal planning problems on such hardly-approachable domains.