Výsledky vyhledávání - Relaxed Dijkstra algorithm

Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments.

Autoři: Ammar, Adel Bennaceur, Hachemi Châari, Imen a další

Zdroj: Soft Computing - A Fusion of Foundations, Methodologies & Applications. Oct2016, Vol. 20 Issue 10, p4149-4171. 23p.

Témata: *ROBOTIC path planning, *GRAPH algorithms, *GRID computing, *NONPARAMETRIC estimation, *QUEUING theory

Dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system.

Autoři: Zhang, Jing Bai, Jingpan

Zdroj: Wireless Networks (10220038); Apr2024, Vol. 30 Issue 3, p1201-1219, 19p

Témata: EDGE computing, COMPUTER systems, ALGORITHMS, WEIGHTED graphs, QUALITY of service, DRONE aircraft

A Generic Approach on How to Formally Specify and Model Check Path Finding Algorithms: Dijkstra, A* and LPA*.

Autoři: Ogata, Kazuhiro¹ (AUTHOR) ogata@jaist.ac.jp

Zdroj: International Journal of Software Engineering & Knowledge Engineering. Oct2020, Vol. 30 Issue 10, p1481-1523. 43p.

Témata: *ALGORITHMS, GOAL (Psychology)

An Efficient Path Planning in Uncertainty Environments using Dynamic Grid-Based and Potential Field Methods.

Autoři: Al-Ansarry, Suhaib Al-Darraji, Salah Honi, Dhafer G.

Zdroj: Iraqi Journal for Electrical & Electronic Engineering; Dec2023, Vol. 19 Issue 2, p90-99, 10p

Témata: INDUSTRIAL robots, ROBOTICS, ROBOTS, ALGORITHMS, SAFETY

Refined Network Topology for Improved Reliability and Enhanced Dijkstra Algorithm for Optimal Path Selection during Link Failures in Cluster Microgrids.

Autoři: Pradeep Reddy, Gogulamudi Kumar, Yellapragada Venkata Pavan Kalyan Chakravarthi, Maddikera a další

Zdroj: Sustainability (2071-1050); Aug2022, Vol. 14 Issue 16, p10367-10367, 21p

Path planning of intelligent mobile robot based on Dijkstra algorithm

Autoři: Li, Xueyan

Zdroj: Journal of Physics: Conference Series ; volume 2083, issue 4, page 042034 ; ISSN 1742-6588 1742-6596

Dostupnost: https://doi.org/10.1088/1742-6596/2083/4/042034
https://iopscience.iop.org/article/10.1088/1742-6596/2083/4/042034
https://iopscience.iop.org/article/10.1088/1742-6596/2083/4/042034/pdf

A Lane Level Bi-Directional Hybrid Path Planning Method Based on High Definition Map.

Autoři: Bin Yang Xuewei Song Zhenhai Gao

Zdroj: World Electric Vehicle Journal; Dec2021, Vol. 12 Issue 4, p1-18, 18p

Témata: AUTONOMOUS vehicles, SEARCH algorithms, INFORMATION retrieval, DATA analysis, ACCURACY

基于概率路由的出租车共乘调度算.

Alternate Title: Algorithm for taxi ride-sharing scheduling based on probabilistic routing.

Autoři: 蔡文广 刘佳旭 张小欣

Zdroj: Application Research of Computers / Jisuanji Yingyong Yanjiu. Feb2024, Vol. 41 Issue 2, p432-437. 6p.

Témata: *K-means clustering, *RIDESHARING

Improved Optimization Strategy Based on Region Division for Collaborative Multi-Agent Coverage Path Planning.

Autoři: Qin, Yijie Fu, Lei He, Dingxin a další

Zdroj: Sensors (14248220); Apr2023, Vol. 23 Issue 7, p3596, 21p

Témata: OPTIMIZATION algorithms, GEODESIC distance, EULERIAN graphs, GEODESICS, MULTIAGENT systems, ALGORITHMS

Identification and conservation of critical nodes for shorebirds based on migration network perspective.

Autoři: Xiao, Qing Duan, Houlang Zhu, Bingrun a další

Zdroj: Movement Ecology. 10/6/2025, Vol. 13 Issue 1, p1-14. 14p.

Reverse keyword-based location search on road networks.

Autoři: Chen, Zijun Wang, Xin Liu, Wenyuan

Zdroj: GeoInformatica; Jan2022, Vol. 26 Issue 1, p201-231, 31p

Témata: ROADS, ALGORITHMS, ARGUMENT, EDGES (Geometry)

Sustainable hierarchical multi-modal hub network design problem: bi-objective formulations and solution algorithms.

Autoři: Nasiri, Mohammad Mahdi Khaleghi, Amir Govindan, Kannan a další

Zdroj: Operational Research; Jun2023, Vol. 23 Issue 2, p1-62, 62p

Dijkstra algorithm based on a reliability model.

Autoři: Parra, Octavio J. Salcedo Rubio, Gustavo Lopez Daza, Brayan S. Reyes

Zdroj: International Conference on Information Society (i-Society 2014); 2014, p45-49, 5p

Dijkstra Algorithm Based Reliability Model.

Autoři: Parra, Octavio J. Salcedo Rubio, Gustavo Lopez Castellanos, Lilia

Zdroj: 2012 IEEE/ACM 16th International Symposium on Distributed Simulation & Real Time Applications; 1/ 1/2012, p157-160, 4p

Fast Approximate Algorithm for the Single Source Shortest Path with Lazy Update

Autoři: Tomohiro Takahashi Yasuhiro Takashima

Zdroj: 2018 New Generation of CAS (NGCAS). :94-97

Témata: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: http://xplorestaging.ieee.org/ielx7/8554190/8572037/08572070.pdf?arnumber=8572070
http://dblp.uni-trier.de/db/conf/ngcas/ngcas2018.html#TakahashiT18
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=8572070
https://doi.org/10.1109/NGCAS.2018.8572070

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers

Autoři: Alistarh, Dan Nadiradze, Giorgi Koval, Nikita

Zdroj: 31st ACM Symposium on Parallelism in Algorithms and Architectures
The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Témata: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/pdf/2003.09363
http://arxiv.org/abs/2003.09363
https://arxiv.org/abs/2003.09363
https://arxiv.org/pdf/2003.09363
https://ui.adsabs.harvard.edu/abs/2020arXiv200309363A/abstract
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-09363
https://research-explorer.app.ist.ac.at/record/6673
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-09363
https://doi.org/10.1145/3323165.3323201

More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm

Autoři: Kainer, Michael Träff, Jesper Larsson

Témata: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, 0102 computer and information sciences, Distributed, Parallel, and Cluster Computing (cs.DC), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/1903.12085

Modified Dijkstra’s Algorithm for Dense Graphs on GPU using CUDA

Autoři: Dhirendra Pratap Singh Nilay Khare

Zdroj: Indian Journal of Science and Technology. 9

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Přístupová URL adresa: https://indjst.org/articles/modified-dijkstras-algorithm-for-dense-graphs-on-gpu-using-cuda
http://www.indjst.org/index.php/indjst/article/view/87795

Social Recommendation Combining Trust Relationship and Distance Metric Factorization.

Autoři: Ye, Ming Deng, Yuanle

Zdroj: Journal of Circuits, Systems & Computers; Nov2020, Vol. 29 Issue 15, pN.PAG-N.PAG, 18p

Témata: FACTORIZATION, MATRIX decomposition, ALGORITHMS, SPARSE matrices, TRUST, RECOMMENDER systems

A faster capacity scaling algorithm for minimum cost submodular flow.

Autoři: Fleischer, Lisa Iwata, Satoru McCormick, S. Thomas

Zdroj: Mathematical Programming. 2002, Vol. 92 Issue 1, p119. 21p.

Témata: *ALGORITHMS, *SUBMODULAR functions