ULRICH-OLTEAN, FELIX orcid.org/0000-0001-5162-5826, BATE, IAIN JOHN orcid.org/0000-0003-2415-8219, LIU, PENGCHENG orcid.org/0000-0003-0677-4421 et al. (1 more author) (2026) PAMPR: Predictability-Aware Motion Planning for Robots. In: Annual Conference Towards Autonomous Robotic Systems:proceedings. 27th Annual Conference Towards Autonomous Robotic Systems, 07-09 Sep 2026 Lecture Notes in Computer Science. Springer, GBR. (In Press)
Abstract
Motion planning algorithms are crucial to the effective operation of robots; however, many motion planning algorithms exist, and they have complementary strengths when applied to different planning scenarios. The goal of this work is to increase predictability in the context of motion planning across a set of targets. A challenge is that each task and each planner have different levels of variability in the time they need for each target. The sub-goals of this work are therefore to shorten the time to complete the sequence at the same time as reducing the variability of the completion time. This combination helps reduce the likelihood that a deadline is missed. Our framework for predictability-aware motion planning for robots (PAMPR) uses machine learning to predict the planning and execution time for each available algorithm and query; these predictions are then used by a constraint solver to find an optimal sequence of targets and algorithm choices. We use an assistive robot arm example to show that this approach can lead to faster and more predictable completion times for the collection of tasks. Compared to the single best planner according to the training data, PAMPR reduces the right tail of the distribution by 47% and is twice as fast on average.
Metadata
| Item Type: | Proceedings Paper |
|---|---|
| Authors/Creators: |
|
| Copyright, Publisher and Additional Information: | This is an author-produced version of the published paper. Uploaded in accordance with the University’s Research Publications and Open Access policy. |
| Keywords: | robot motion planning,algorithm selection,machine learning,planning under uncertainty |
| Dates: |
|
| Institution: | The University of York |
| Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
| Date Deposited: | 24 Jun 2026 14:00 |
| Last Modified: | 24 Jun 2026 14:00 |
| Status: | In Press |
| Publisher: | Springer |
| Series Name: | Lecture Notes in Computer Science |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:242492 |

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)