Anytime search in dynamic graphs

Author:

Likhachev Maxim,Ferguson Dave,Gordon Geoff,Stentz Anthony,Thrun Sebastian

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference68 articles.

1. A formal basis for the heuristic determination of minimum cost paths;Hart;IEEE Transactions on Systems, Science, and Cybernetics SSC,1968

2. A note on two problems in connexion with graphs;Dijkstra;Numerische Mathematik,1959

3. Generalized best-first search strategies and the optimality af A∗;Dechter;Journal of the Association for Computing Machinery,1985

4. Approximate reasoning using anytime algorithms;Zilberstein,1995

5. T.L. Dean, M. Boddy, An analysis of time-dependent planning, in: Proceedings of the National Conference on Artificial Intelligence (AAAI), 1988

Cited by 133 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An energy-efficient path planning method for unmanned surface vehicle in a time-variant maritime environment;Ocean Engineering;2024-06

2. Safety Verification of Closed-loop Control System with Anytime Perception;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13

3. Adaptive hybrid local–global sampling for fast informed sampling-based optimal path planning;Autonomous Robots;2024-04-20

4. An emergency pedestrian collision avoidance system based on V2V communication;Third International Conference on Advanced Manufacturing Technology and Electronic Information (AMTEI 2023);2024-04-01

5. Multi-agent policy learning-based path planning for autonomous mobile robots;Engineering Applications of Artificial Intelligence;2024-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3