Approximate solutions for the minimal revision problem of specification automata

Kangjin Kim, Georgios Fainekos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

As robots are being integrated into our daily lives, it becomes necessary to provide guarantees of safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as 'close' as possible to the initial user intent. Unfortunately, the latter problem, which is referred to as minimal specification revision problem, is NP complete. This paper presents an approximation algorithm that can compute good approximations to the minimal revision problem in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Intelligent Robots and Systems
Pages265-271
Number of pages7
DOIs
StatePublished - 2012
Event25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012 - Vilamoura, Algarve, Portugal
Duration: Oct 7 2012Oct 12 2012

Other

Other25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012
CountryPortugal
CityVilamoura, Algarve
Period10/7/1210/12/12

Fingerprint

Robots
Specifications
Temporal logic
Approximation algorithms
Heuristic algorithms
Computational complexity
Polynomials
Feedback
Planning

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computer Vision and Pattern Recognition
  • Computer Science Applications

Cite this

Kim, K., & Fainekos, G. (2012). Approximate solutions for the minimal revision problem of specification automata. In IEEE International Conference on Intelligent Robots and Systems (pp. 265-271). [6386215] https://doi.org/10.1109/IROS.2012.6386215

Approximate solutions for the minimal revision problem of specification automata. / Kim, Kangjin; Fainekos, Georgios.

IEEE International Conference on Intelligent Robots and Systems. 2012. p. 265-271 6386215.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, K & Fainekos, G 2012, Approximate solutions for the minimal revision problem of specification automata. in IEEE International Conference on Intelligent Robots and Systems., 6386215, pp. 265-271, 25th IEEE/RSJ International Conference on Robotics and Intelligent Systems, IROS 2012, Vilamoura, Algarve, Portugal, 10/7/12. https://doi.org/10.1109/IROS.2012.6386215
Kim K, Fainekos G. Approximate solutions for the minimal revision problem of specification automata. In IEEE International Conference on Intelligent Robots and Systems. 2012. p. 265-271. 6386215 https://doi.org/10.1109/IROS.2012.6386215
Kim, Kangjin ; Fainekos, Georgios. / Approximate solutions for the minimal revision problem of specification automata. IEEE International Conference on Intelligent Robots and Systems. 2012. pp. 265-271
@inproceedings{300faa2f15094ae5b2f8403b6371e65b,
title = "Approximate solutions for the minimal revision problem of specification automata",
abstract = "As robots are being integrated into our daily lives, it becomes necessary to provide guarantees of safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as 'close' as possible to the initial user intent. Unfortunately, the latter problem, which is referred to as minimal specification revision problem, is NP complete. This paper presents an approximation algorithm that can compute good approximations to the minimal revision problem in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.",
author = "Kangjin Kim and Georgios Fainekos",
year = "2012",
doi = "10.1109/IROS.2012.6386215",
language = "English (US)",
isbn = "9781467317375",
pages = "265--271",
booktitle = "IEEE International Conference on Intelligent Robots and Systems",

}

TY - GEN

T1 - Approximate solutions for the minimal revision problem of specification automata

AU - Kim, Kangjin

AU - Fainekos, Georgios

PY - 2012

Y1 - 2012

N2 - As robots are being integrated into our daily lives, it becomes necessary to provide guarantees of safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as 'close' as possible to the initial user intent. Unfortunately, the latter problem, which is referred to as minimal specification revision problem, is NP complete. This paper presents an approximation algorithm that can compute good approximations to the minimal revision problem in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.

AB - As robots are being integrated into our daily lives, it becomes necessary to provide guarantees of safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the requirements are expressed as temporal logic specifications. However, in real-life scenarios, it is to be expected that not all user task requirements can be realized by the robot. In such cases, the robot must provide feedback to the user on why it cannot accomplish a given task. Moreover, the robot should indicate what tasks it can accomplish which are as 'close' as possible to the initial user intent. Unfortunately, the latter problem, which is referred to as minimal specification revision problem, is NP complete. This paper presents an approximation algorithm that can compute good approximations to the minimal revision problem in polynomial time. The experimental study of the algorithm demonstrates that in most problem instances the heuristic algorithm actually returns the optimal solution. Finally, some cases where the algorithm does not return the optimal solution are presented.

UR - http://www.scopus.com/inward/record.url?scp=84872346869&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872346869&partnerID=8YFLogxK

U2 - 10.1109/IROS.2012.6386215

DO - 10.1109/IROS.2012.6386215

M3 - Conference contribution

AN - SCOPUS:84872346869

SN - 9781467317375

SP - 265

EP - 271

BT - IEEE International Conference on Intelligent Robots and Systems

ER -