|
|
|
|
|
Xiwei Zhou, Jingwen Yan, Mei Yan, Kaihao Mao, Ruizhe Yang and Weiyu Liu
The improved Dijkstra algorithm proposed herein can be effectively applied to rail-mounted robots to distribute goods in large workshops, especially in ultra-clean semiconductor chip production workshops. The algorithm can plan the shortest route for the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ruth Cordova-Cardenas, Luis Emmi and Pablo Gonzalez-de-Santos
This study presents the development of a route planner, called Mission Planner, for an agricultural weeding robot that generates efficient and safe routes both in the field and on the farm using a graph-based approach. This planner optimizes the robot?s ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir Korkhov, Ivan Gankevich, Anton Gavrikov, Maria Mingazova, Ivan Petriakov, Dmitrii Tereshchenko, Artem Shatalin and Vitaly Slobodskoy
Bottlenecks and imbalance in parallel programs can significantly affect performance of parallel execution. Finding these bottlenecks is a key issue in performance analysis of MPI programs especially on a large scale. One of the ways to discover bottlenec...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xiaojun Li, Weibing Wang, Ganghui Liu, Runze Li and Fei Li
In greenhouse nurseries, one of the important tasks of the automatic transplanter is replanting missing or bad seedling holes with healthy seedlings. This requires the transplanter to spend significant time moving between the supply trays and target tray...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shruti Bharadwaj, Rakesh Dubey, Md Iltaf Zafar, Rashid Faridi, Debashish Jena and Susham Biswas
Urban planning, noise propagation modelling, viewshed analysis, etc., require determination of routes or supply lines for propagation. A point-to-point routing algorithm is required to determine the best routes for the propagation of noise levels from so...
ver más
|
|
|
|
|
|
|
|
|
|
|
Xu Chen, Shaohua Wang, Huilai Li, Fangzheng Lyu, Haojian Liang, Xueyan Zhang and Yang Zhong
The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd?Warsh...
ver más
|
|
|
|
|
|
|
|
|
|
|
Arbi Haza Nasution, Shella Eldwina Fitri, Rizauddin Saian, Winda Monika and Nasreen Badruddin
Indonesia has a diverse ethnic and cultural background. However, this diversity sometimes creates social problems, such as intertribal conflict. Because of the large differences among tribal languages, it is often difficult for conflicting parties to dia...
ver más
|
|
|
|
|
|
|
|
|
|
|
Qi Jia, Yulei Liao, Peihong Xu, Zixiao Wang, Shuo Pang and Xiangjie Li
To meet the mission requirements of long-endurance and unmanned marine environment observation, the natural energy-driven unmanned surface vehicle (NSV) usually takes special sailing paths to increase energy capture to achieve the purpose of improving en...
ver más
|
|
|
|
|
|
|
|
|
|
|
Byeong Cheol Lee, Youngsu Choi and Hyun Chung
The offshore plant, due to its characteristics, is subject to many restrictions on the material and design of the pipes. Because the design of the firefighting piping depends on the pre-set fire protection design, it is possible to reduce the cost of the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aydin GULLU, Hilmi KUSÇU
Pág. 222 - 238
Graph search algorithms and shortest path algorithms, designed to allow real mobile robots to search unknown environments, are typically run in a hybrid manner, which results in the fast exploration of an entire environment using the shortest path. In th...
ver más
|
|
|
|
|
|