Christoph Greulich

Learn More
The Physical Traveling Salesman Problem (PTSP) is a current research problem which adds a model of velocity to the classic TSP. In this paper we propose algorithms for solving the PTSP which avoid the fragmented allocation of memory and precompute cell-precise single-source shortest paths for each waypoint by using an engineered implementation of Dijkstra's(More)
— This paper describes an effective approach to solve the inspection problem via colored traveling salesman tours. Given an environment with obstacles and regions to be inspected, the approach plans a collision-free and dynamically-feasible motion trajectory that enables the vehicle to inspect all the regions of interest while reducing the distance(More)
This paper addresses improved urban mobility using multiagent simulation. We provide a description of the agent model and the routing infrastructure as a step towards a rich model of the interactions that happen in intermodal transport planning tasks. The multiagent model is generic in the sense that different public and individual transport agents and(More)