Route bundling in polygonal domains using Differential Evolution-Reference-Cited by-同舟云学术

Route bundling in polygonal domains using Differential Evolution

Published:2017-12 Issue:1 Volume:4 Page:
ISSN:2197-3768
Container-title:Robotics and Biomimetics
language:en
Short-container-title:Robot. Biomim.

Author:

Parque Victor^ORCID,Miura Satoshi,Miyashita Tomoyuki

Publisher

Springer Science and Business Media LLC

Link

http://link.springer.com/content/pdf/10.1186/s40638-017-0079-x.pdf

Reference35 articles.

1. Dijkstra EW. A note on two problems in connexion with graphs. Numer Math. 1959;1:269–71.

2. Cormen T, Leiserson C, Rivest R. Introduction to algorithms. Cambridge: MIT Press; 1993.

3. Hart PE, Nilsson NJ, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern. 1968;4(2):100–7.

4. Kallmann M. Path planning in triangulations. In: Proceedings of the workshop on reasoning, representation, and learning in computer games, IJCAI, 2005. p 49–54

5. Chazelle B. A Theorem on polygon cutting with applications. In: Proceedings of the 23rd IEEE symposium on foundations of computer science, 1982. p. 339–49

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

1. Smooth Curve Fitting of Mobile Robot Trajectories Using Differential Evolution;IEEE Access;2020

2. Obstacle-Avoiding Euclidean Steiner Trees by n-Star Bundles;2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI);2018-11

3. Towards bundling minimal trees in polygonal maps;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2018-07-06

4. Path Planning on Hierarchical Bundles with Differential Evolution;Lecture Notes in Computer Science;2018