Allowing larger deviation from the reference path while guaranteeing convergence in dynamic or unknown environments
Determine how to modify the MPC-based motion planning scheme that uses a reference path so that it permits greater deviation from the reference path in dynamic environments or with unknown obstacles while still guaranteeing convergence to the target; in particular, characterize how obstacle size, prediction horizon length, and the presence of local minima affect this guarantee.
References
Furthermore, while we argue it is necessary, the strong dependence on the reference path is a limitation in dynamic environments or with unknown obstacles. In these cases, it becomes desirable to allow further deviation from the reference path, while still guaranteeing convergence to the target. This is an open question and important topic for future research. It could probably be solved, if an answer is found on how obstacle size, length of the prediction horizon and existence of local minima are related.
This avoidance is reactive, inherited from Falco. It suffices for low-density motion, but fast obstacles on random trajectories are hard to evade; moreover, evasive detours can steer the robot off the planned path and trigger relocalization, lowering success. Handling such cases requires velocity-level reasoning and trajectory prediction, left to future work.