Transportation under Nasty Side Constraints
The talk discusses planning problems where a set of items has to be transported from location A to location B subject to certain collision and/or resource constraints. We analyze the behavior of these problems, discuss their history, and derive some of their combinatorial and algorithmic properties.
KeywordsMotion Planning Transportation Problem Discrete Mathematic Vertex Cover Feasible Schedule
- 2.Eggermont, C., Woeginger, G.J.: Motion planning with pulley, rope, and baskets. In: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics, vol. 14, pp. 374–383 (2012)Google Scholar