Timelines Are Expressive Enough to Capture Action-Based Temporal Planning

2016 ◽  
Author(s):  
Nicola Gigante ◽  
Angelo Montanari ◽  
Marta Cialdea Mayer ◽  
Andrea Orlandini
Keyword(s):  
Temporal Planning

A CSP-Based Approach for Temporal Constraints in Temporal Planning

2012 ◽  
Vol 35 (8) ◽  
pp. 1759
Author(s):  
Li-Hua WU ◽  
Ai-Xiang CHEN ◽  
Yun-Fei JIANG ◽  
Rui BIAN
Keyword(s):  
Temporal Constraints ◽  
Temporal Planning

AUV mission control via temporal planning

2014 ◽  
Author(s):  
Michael Cashmore ◽  
Maria Fox ◽  
Tom Larkworthy ◽  
Derek Long ◽  
Daniele Magazzeni
Keyword(s):  
Temporal Planning ◽  
Mission Control

QoS-Aware Dynamic Composition of Web Services Using Numerical Temporal Planning

2014 ◽  
Vol 7 (1) ◽  
pp. 18-31 ◽  
Author(s):  
Guobing Zou ◽  
Qiang Lu ◽  
Yixin Chen ◽  
Ruoyun Huang ◽  
You Xu ◽  
...  
Keyword(s):  
Web Services ◽  
Dynamic Composition ◽  
Temporal Planning

scholarly journals Automated Verification of Social Laws for Continuous Time Multi-Robot Systems

2019 ◽  
Vol 33 ◽  
pp. 7683-7690 ◽  
Author(s):  
Ronen Nir ◽  
Erez Karpas
Keyword(s):  
Continuous Time ◽  
Automated Verification ◽  
Shared Environment ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Temporal Planning ◽  
Social Law ◽  
Robot Systems ◽  
Multi Agent ◽  
Multi Robot

Designing multi-agent systems, where several agents work in a shared environment, requires coordinating between the agents so they do not interfere with each other. One of the canonical approaches to coordinating agents is enacting a social law, which applies restrictions on agents’ available actions. A good social law prevents the agents from interfering with each other, while still allowing all of them to achieve their goals. Recent work took the first step towards reasoning about social laws using automated planning and showed how to verify if a given social law is robust, that is, allows all agents to achieve their goals regardless of what the other agents do. This work relied on a classical planning formalism, which assumed actions are instantaneous and some external scheduler chooses which agent acts next. However, this work is not directly applicable to multi-robot systems, because in the real world actions take time and the agents can act concurrently. In this paper, we show how the robustness of a social law in a continuous time setting can be verified through compilation to temporal planning. We demonstrate our work both theoretically and on real robots.

Sign in / Sign up

Export Citation Format

Share Document