Kinodynamic Motion Planning via Branch-and-Cut Over Probabilistic Roadmaps-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Kinodynamic Motion Planning via Branch-and-Cut Over Probabilistic Roadmaps

Published:2024-01 Issue:1 Volume:9 Page:247-254
ISSN:2377-3766
Container-title:IEEE Robotics and Automation Letters
language:
Short-container-title:IEEE Robot. Autom. Lett.

Author:

Ramirez Miquel¹^ORCID,Selvaratnam Daniel²^ORCID,Manzie Chris¹^ORCID

Affiliation:

1. Department of Electrical and Electronic Engineering, University of Melbourne, Parkville, VIC, Australia

2. Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden

Funder

Australian Government through Trusted Autonomous Systems, a Defence Cooperative Research Centre

Next Generation Technologies Fund

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Artificial Intelligence,Control and Optimization,Computer Science Applications,Computer Vision and Pattern Recognition,Mechanical Engineering,Human-Computer Interaction,Biomedical Engineering,Control and Systems Engineering

Link

http://xplorestaging.ieee.org/ielx7/7083369/10320104/10306255.pdf?arnumber=10306255

Reference47 articles.

1. Sampling-based motion planning with temporal goals

2. Branch-and-cut algorithms for combinatorial optimization problems;mitchell;Handbook of Applied Optimization,2000

3. Revisiting the Asymptotic Optimality of RRT

4. Column Generation

5. Motion planning with sequential convex optimization and convex collision checking

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP