An efficient algorithm for one-step planar compliant motion planning with uncertainty
Author:
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Link
http://link.springer.com/content/pdf/10.1007/BF01758843.pdf
Reference20 articles.
1. T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai. Visibility of disjoint polygons.Algorithmica, 1:49–63, 1986.
2. A. J. Briggs. An efficient algorithm for one-step planar compliant motion planning with uncertainty. InProc. ACM Symposium on Computational Geometry, Saarbrücken, June 1989, pp. 187–196.
3. R. C. Brost. Computing metric and topological properties of configuration-space obstacles. InProc. IEEE International Conference on Robotics and Automation, Phoenix, AZ, May 1989, pp. 170–176.
4. J. F. Canny. On computability of fine motion plans. InProc. IEEE International Conference on Robotics and Automation, Phoenix, AZ, May 1989, pp. 177–182.
5. J. F. Canny and J. Reif. New lower bound techniques for robot motion planning problems. InProc. IEEE Symposium on Foundations of Computer Science, 1987, pp. 49–60.
Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles;Discrete Mathematics, Algorithms and Applications;2022-04-22
2. Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles;Combinatorial Optimization and Applications;2020
3. Impedance Control and Force Estimation of a Redundant Parallel Kinematic Manipulator;Informatics in Control, Automation and Robotics;2019-04-18
4. Pushing a Disk Using Compliance;IEEE Transactions on Robotics;2007-06
5. Path planning for pushing a disk using compliance;2005 IEEE/RSJ International Conference on Intelligent Robots and Systems;2005
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3