Solving global two-dimensional routing problems using snell's law and a search
Open Access
- 23 March 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 1631-1636
- https://doi.org/10.1109/robot.1987.1087800
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Architecture and early experience with planning for the ALVPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Exploiting capability constraints to solve global two-dimensional path planning problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979