TU Darmstadt / ULB / TUbiblio

Computational Complexity of Path Planning Algorithms Based on Safe Triangles and Quadtree as Work Space Representation: A Comparison

Mao, Xiaozhao (1991):
Computational Complexity of Path Planning Algorithms Based on Safe Triangles and Quadtree as Work Space Representation: A Comparison.
Vienna, Austria, In: IFAC Symposium SYROCO, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 1991
Creators: Mao, Xiaozhao
Title: Computational Complexity of Path Planning Algorithms Based on Safe Triangles and Quadtree as Work Space Representation: A Comparison
Language: English
Place of Publication: Vienna, Austria
Divisions: 18 Department of Electrical Engineering and Information Technology > Institut für Automatisierungstechnik und Mechatronik > Control Methods and Robotics
18 Department of Electrical Engineering and Information Technology > Institut für Automatisierungstechnik und Mechatronik
18 Department of Electrical Engineering and Information Technology
Event Title: IFAC Symposium SYROCO
Date Deposited: 08 Oct 2010 12:43
Export:

Optionen (nur für Redakteure)

View Item View Item