The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
An algorithm for planning collision-free paths among polyhedral obstacles
Abstract
article Free Access Share on An algorithm for planning collision-free paths among polyhedral obstacles Authors: Tomás Lozano-Pérez Massachusetts Institute of Technology, Cambridge Massachusetts Institute of Technology, CambridgeView Profile , Michael A. Wesley IBM Thomas J. Watson Research Center, Yorktown Heights, NY IBM Thomas J. Watson Research Center, Yorktown Heights, NYView Profile Authors Info & Claims Communications of the ACMVolume 22Issue 10Oct. 1979 pp 560–570https://doi.org/10.1145/359156.359164Published:01 October 1979Publication History 1,578citation4,889DownloadsMetricsTotal Citations1,578Total Downloads4,889Last 12 Months450Last 6 weeks60 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
A Mobile Automaton: An Application of Artificial Intelligence Techniques
Nilsson, N. J. (1969) · doi:10.21236/ada459660 · Cited by 552
Interference detection among solids and surfaces
Boyse, J. W. (1979) · Communications of the ACM · doi:10.1145/359046.359048 · Cited by 266
The Design of a Mechanical Assembly System
Lozano‐Pérez, T. (1976) · Defense Technical Information Center (DTIC) · Cited by 114
Self-citation(1975) · Computer-Aided Design · doi:10.1016/0010-4485(75)90098-6 · Cited by 92
Cited by
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
“Previous roadmap methods include the visibility graph [ 39 ], Voronoi diagram [41], and silhouette [8] methods.”
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Compliance and Force Control for Computer Controlled Manipulators
Mason, M. T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308708 · Cited by 1,542
Vision for mobile robot navigation: a survey
Desouza, G. N., & Kak, A. C. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.982903 · Cited by 1,357
Path planning techniques for unmanned aerial vehicles: A review, solutions, and challenges
Aggarwal, S., & Kumar, N. (2020) · Computer Communications · doi:10.1016/j.comcom.2019.10.014 · Cited by 971
Real-Time Motion Planning for Agile Autonomous Vehicles
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4856 · Cited by 830
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
Symbolic reasoning among 3-D models and 2-D images
Brooks, R. A. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90028-x · Cited by 775
A review of mobile robots: Concepts, methods, theoretical framework, and applications
Rubio, F., Valero, F., & Llopis-Albert, C. (2019) · International Journal of Advanced Robotic Systems · doi:10.1177/1729881419839596 · Cited by 763
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Simulating Humans: Computer Graphics, Animation, and Control
Badler, N. I., Phillips, C. B., & Webber, B. L. (1993) · Oxford University Press eBooks · doi:10.1093/oso/9780195073591.001.0001 · Cited by 751
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
Self-citationMitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H. (1987) · SIAM Journal on Computing · doi:10.1137/0216045 · Cited by 720
Lumelsky, V. J., & Stepanov, A. A. (1987) · Algorithmica · doi:10.1007/bf01840369 · Cited by 699
Automatic Planning of Manipulator Transfer Movements
Lozano-Perez, T. (1981) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1981.4308589 · Cited by 692
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Collision Detection and Response for Computer Animation
Moore, M., & Wilhelms, J. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378528 · Cited by 678
A Review of Motion Planning for Highway Autonomous Driving
Claussmann, L., Revilloud, M., Gruyer, D., & Glaser, S. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2913998 · Cited by 670
Complex network approaches to nonlinear time series analysis
Zou, Y., Donner, R. V., Marwan, N., Donges, J. F., & Kurths, J. (2019) · Physics Reports · doi:10.1016/j.physrep.2018.10.005 · Cited by 634
A simple motion-planning algorithm for general robot manipulators
Lozano-Perez, T. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087095 · Cited by 618
Mechanics and Planning of Manipulator Pushing Operations
Mason, M. T. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500303 · Cited by 563
New lower bound techniques for robot motion planning problems
Canny, J., & Reif, J. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.42 · Cited by 538
Theta*: Any-Angle Path Planning on Grids
Daniel, K., Nash, A., Koenig, S., & Felner, A. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2994 · Cited by 465
Schwartz, J. T., & Sharir, M. (1983) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160360305 · Cited by 454
Multiresolution path planning for mobile robots
Kambhampati, S., & Davis, L. (1986) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1986.1087051 · Cited by 442
Motion planning in a plane using generalized Voronoi diagrams
Takahashi, O., & Schilling, R. J. (1989) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88035 · Cited by 417
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139620 · Cited by 416
Integrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
Self-citationRobot path planning in uncertain environment using multi-objective particle swarm optimization
Zhang, Y., Gong, D.-W., & Zhang, J.-H. (2013) · Neurocomputing · doi:10.1016/j.neucom.2012.09.019 · Cited by 406
A “retraction” method for planning the motion of a disc
Ó'Dúnlaing, C., & Yap, C. K. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90021-5 · Cited by 404
Optimal path planning of mobile robots: A review
Raja, P. (2012) · International Journal of the Physical Sciences · doi:10.5897/ijps11.1745 · Cited by 404
Differentially constrained mobile robot motion planning in state lattices
Pivtoraiko, M., Knepper, R. A., & Kelly, A. (2009) · Journal of Field Robotics · doi:10.1002/rob.20285 · Cited by 393
Euclidean shortest paths in the presence of rectilinear barriers
Lee, D. T., & Preparata, F. P. (1984) · Networks · doi:10.1002/net.3230140304 · Cited by 387
Toward a Theory of Geometric Tolerancing
Requicha, A. A. G. (1983) · The International Journal of Robotics Research · doi:10.1177/027836498300200403 · Cited by 387
Global path planning using artificial potential fields
Warren, C. W. (2003) · Proceedings, 1989 International Conference on Robotics and Automation · doi:10.1109/robot.1989.100007 · Cited by 370
The Stanford Cart and the CMU Rover
Moravec, H. P. (1990) · Autonomous Robot Vehicles · doi:10.1007/978-1-4613-8997-2_30 · Cited by 342
An Untethered, Electrostatic, Globally Controllable MEMS Micro-Robot
Donald, B. R., Levey, C. G., McGray, C. D., Paprotny, I., & Rus, D. (2006) · Journal of Microelectromechanical Systems · doi:10.1109/jmems.2005.863697 · Cited by 339
Integrated task and motion planning in belief space
Kaelbling, L. P., & Lozano-Pérez, T. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913484072 · Cited by 328
Self-citationQualitative spatial reasoning: The CLOCK project
Forbus, K. D., Nielsen, P., & Faltings, B. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90116-2 · Cited by 315
On Shortest Paths in Polyhedral Spaces
Sharir, M., & Schorr, A. (1986) · SIAM Journal on Computing · doi:10.1137/0215014 · Cited by 313
The Stanford Cart and the CMU Rover
Moravec, H. P. (1983) · Proceedings of the IEEE · doi:10.1109/proc.1983.12684 · Cited by 309
Nonholonomic navigation and control of cooperating mobile manipulators
Tanner, H. G., Loizou, S. G., & Kyriakopoulos, K. J. (2003) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.807549 · Cited by 305
Solid Modeling: Current Status and Research Directions
G. Requicha, A., & Voelcker, H. (1983) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.1983.263271 · Cited by 301
Constructing the visibility graph for n-line segments in O(n2) time
Welzl, E. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90044-4 · Cited by 298
A sensor-based navigation for a mobile robot using fuzzy logic and reinforcement learning
Beom, H. R., & Cho, H. S. (1995) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.364859 · Cited by 291
Motion Planning Networks: Bridging the Gap Between Learning-Based and Classical Motion Planners
Qureshi, A. H., Miao, Y., Simeonov, A., & Yip, M. C. (2021) · IEEE Transactions on Robotics · doi:10.1109/tro.2020.3006716 · Cited by 287
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
A local based approach for path planning of manipulators with a high number of degrees of freedom
Faverjon, B., & Tournassoud, P. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1087982 · Cited by 281
Distributed algorithms for formation of geometric patterns with many mobile robots
Sugihara, K., & Suzuki, I. (1996) · Journal of Robotic Systems · doi:10.1002/(sici)1097-4563(199603)13:3<127::aid-rob1>3.0.co;2-u · Cited by 273
A mobile robot exploration algorithm
Zelinsky, A. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.182671 · Cited by 273
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
Latombe, J.-C. (1999) · The International Journal of Robotics Research · doi:10.1177/02783649922067753 · Cited by 264
Qureshi, A. H., & Ayaz, Y. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2015.02.007 · Cited by 262
Path-Planning for Unmanned Aerial Vehicles with Environment Complexity Considerations: A Survey
Jones, M., Djahel, S., & Welsh, K. (2023) · ACM Computing Surveys · doi:10.1145/3570723 · Cited by 258
Manipulator control with superquadric artificial potential functions: theory and experiments
Volpe, R., & Khosla, P. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.61211 · Cited by 254
Navigational strategies of mobile robots: a review
Parhi, D. R., & Singh, M. K. (2009) · International Journal of Automation and Control · doi:10.1504/ijaac.2009.025237 · Cited by 29
Interference Detection Between Curved Objects for Computer Animation
Lin, M. C., & Manocha, D. (1993) · Models and Techniques in Computer Animation · doi:10.1007/978-4-431-66911-1_4 · Cited by 16
Metadata
- Authors
- Lozano-Pérez, T., & Wesley, M. A.
- Venue
- Communications of the ACM
- Published
- 1979-10
- Volume
- 22
- Issue
- 10
- Pages
- 560-570
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2163178194
- Cited by
- 2,304
- References
- 5
- FWCI
- 16.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.