Path planning maximising human comfort for assistive robots
- 13 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1421-1427
Abstract
Motion planning for service robots used for human assistance in complex environments is a challenging task with multifaceted requirements. On the one hand, the generated path has to avoid obstacles and satisfy the user requirements. On the other, the generated path has to be perceived as comfortable by the user. An efficient solution to this difficult problem is based on a separation of concerns between two subproblems: 1. generating a sequence of waypoints that connects the source to the destination, 2. generating a path that joins the waypoints and complies with the dynamic constraints. In this paper, we concentrate on the second problem with an explicit focus on how to account for users' comfort. The result is accomplished by solving an optimal control problem that inherently generates the smooth trajectories required by the user. The cost functions used in the optimisation problem allows to take different dimensions of the user's comfort into consideration. Our technique lends itself to an efficient numeric solution and can be easily applied to different algorithms for waypoint generation.Keywords
This publication has 23 references indexed in Scilit:
- Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs2015
- Navigation assistance and guidance of older adults across complex public spaces: the DALi approachIntelligent Service Robotics, 2015
- Robot navigation in dense human crowds: Statistical models and experimental studies of human–robot cooperationThe International Journal of Robotics Research, 2015
- From Proxemics Theory to Socially-Aware Navigation: A SurveyInternational Journal of Social Robotics, 2014
- G1fitting with clothoidsMathematical Methods in the Applied Sciences, 2014
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- From Reeds and Shepp's to Continuous-Curvature PathsIEEE Transactions on Robotics, 2004
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- The space efficiency of quadtreesComputer Graphics and Image Processing, 1982
- A note on two problems in connexion with graphsNumerische Mathematik, 1959