Neural Motion Planners (NMPs) have emerged as a promising tool for solving robot navigation tasks in complex environments. However, these methods often require expert …
The optimal path planning problem is considered for rovers. Tip-over risk is accurately modelled using direction dependence. In the previous direction-independent model, the …
In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the …
DS Yershov, E Frazzoli - The International Journal of …, 2016 - journals.sagepub.com
We present the first asymptotically optimal feedback planning algorithm for nonholonomic systems and additive cost functionals. Our algorithm is based on three well-established …
M Jones, M Haas-Heger… - … International Journal of …, 2024 - journals.sagepub.com
We present an algorithm that, given a representation of a road network in lane-level detail, computes a route that minimizes the expected cost to reach a given destination. In doing so …
JM Mirebeau, L Gayraud, R Barrère… - Concurrency and …, 2023 - Wiley Online Library
We address the computation of paths globally minimizing an energy involving their curvature, with given endpoints and tangents at these endpoints, according to models …
E Cartee, L Lai, Q Song… - 2019 IEEE 58th …, 2019 - ieeexplore.ieee.org
Surveillance-Evasion (SE) games form an important class of adversarial trajectory-planning problems. We consider time-dependent SE games, in which an Evader is trying to reach its …
The classical setting of optimal control theory assumes full knowledge of the process dynamics and the costs associated with every control strategy. The problem becomes much …
We consider both discrete and continuous control problems constrained by a fixed budget of some resource, which may be renewed upon entering a preferred subset of the state space …