An Integrated Rolling Horizon and Adaptive-Refinement Approach for Disjoint Trajectories Optimization

Planning of trajectories, i.e. paths over time, is a challenging task. Thereby, the trajectories for involved commodities often have to be considered jointly as separation constraints have to be respected. This is for example the case in robot motion or air traffic management. Involving these discrete separation constraints in the planning of best possible continuous … Read more

The Non-Stop Disjoint Trajectories Problem

Given an undirected network with traversal times on its edges and connection requests from sources to destinations for commodities with release dates. The non-stop disjoint trajectories problem is to find trajectories that fulfill all requests, such that the commodities never meet. In this extension to the \NP-complete disjoint paths problem, trajectories must satisfy a non-stop … Read more