Newshot

Kairos: A Unified PDDL Planner for Robots: Plans in Milliseconds, with a Guarantee for Every Answer

Summary

arXiv:2610.39454v2 Announce Type: replace-cross Abstract: Robots that plan while they act need a task planner that reads the models their designers write, answers within milliseconds, and says what each answer means. Models are written in the Planning Domain Definition Language (PDDL), which has grown from classical planning to durative actions, numeric resources, time windows and continuous change, while planners cover one fragment each and differ in what their failures mean. The contribution in artificial intelligence is Kairos, a single planner, not a portfolio of existing planners, that covers the whole language and derives what each answer guarantees from the search that produced it. We prove when the exhaustion of a search shows that no plan exists, and give a relaxation of temporal tasks that proves unsolvability where temporal search cannot. For the compression of durative actions, we give a criterion on the values that actions read, prove that compression is sound, and show th…

Original text(via arXiv cs.RO)

Computer Science > Artificial Intelligence

Title:Kairos: A Unified PDDL Planner for Robots: Plans in Milliseconds, with a Guarantee for Every Answer

Abstract:Robots that plan while they act need a task planner that reads the models their designers write, answers within milliseconds, and says what each answer means. Models are written in the Planning Domain Definition Language (PDDL), which has grown from classical planning to durative actions, numeric resources, time windows and continuous change, while planners cover one fragment each and differ in what their failures mean. The contribution in artificial intelligence is Kairos, a single planner, not a portfolio of existing planners, that covers the whole language and derives what each answer guarantees from the search that produced it. We prove when the exhaustion of a search shows that no plan exists, and give a relaxation of temporal tasks that proves unsolvability where temporal search cannot. For the compression of durative actions, we give a criterion on the values that actions read, prove that compression is sound, and show that it is not complete, so its failure is never reported as a proof. An independent validator checks every plan. The engineering application is on-line task planning for robots: Kairos is open source, packaged for the Robot Operating System, and the default planner of a widely used planning framework. On 1,756 public tasks from nine suites, Kairos solves more tasks than the strongest evaluated planner of each suite within 100 milliseconds, 1 second and 30 seconds; it proves ten of eleven unsolvable tasks, and handles each of the seventeen language features probed, where no other planner handles more than eight.
Comments:29 pages, 3 figures, 13 tables. Code: this https URL ; benchmark, scripts and results: this https URL
Subjects:Artificial Intelligence (cs.AI) ; Robotics (cs.RO)
ACM classes:I.2.8
Cite as:arXiv:2610.39454 [cs.AI]
(or arXiv:2610.39454v2 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2610.39454 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.RO
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗