Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.16844 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911278082031616 |
|---|---|
| author | Kamale, Disha Yu, Xi Vasile, Cristian-Ioan |
| author_facet | Kamale, Disha Yu, Xi Vasile, Cristian-Ioan |
| contents | In this work, we consider the problem of planning for temporal logic tasks in large robot environments. When full task compliance is unattainable, we aim to achieve the best possible task satisfaction by integrating user preferences for relaxation into the planning process. Utilizing the automata-based representations for temporal logic goals and user preferences, we propose an A*-based planning framework. This approach effectively tackles large-scale problems while generating near-optimal high-level trajectories. To facilitate this, we propose a simple, efficient heuristic that allows for planning over large robot environments in a fraction of time and search memory as compared to uninformed search algorithms. We present extensive case studies to demonstrate the scalability, runtime analysis as well as empirical bounds on the suboptimality of the proposed heuristic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_16844 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A*-based Temporal Logic Path Planning with User Preferences on Relaxed Task Satisfaction Kamale, Disha Yu, Xi Vasile, Cristian-Ioan Robotics In this work, we consider the problem of planning for temporal logic tasks in large robot environments. When full task compliance is unattainable, we aim to achieve the best possible task satisfaction by integrating user preferences for relaxation into the planning process. Utilizing the automata-based representations for temporal logic goals and user preferences, we propose an A*-based planning framework. This approach effectively tackles large-scale problems while generating near-optimal high-level trajectories. To facilitate this, we propose a simple, efficient heuristic that allows for planning over large robot environments in a fraction of time and search memory as compared to uninformed search algorithms. We present extensive case studies to demonstrate the scalability, runtime analysis as well as empirical bounds on the suboptimality of the proposed heuristic. |
| title | A*-based Temporal Logic Path Planning with User Preferences on Relaxed Task Satisfaction |
| topic | Robotics |
| url | https://arxiv.org/abs/2511.16844 |