|
|
|
|
|
Tamás Kegyes, Alex Kummer, Zoltán Süle and János Abonyi
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line bal...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdul Majeed and Seong Oun Hwang
This paper presents a multi-objective coverage flight path planning algorithm that finds minimum length, collision-free, and flyable paths for unmanned aerial vehicles (UAV) in three-dimensional (3D) urban environments inhabiting multiple obstacles for c...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ai-Hua Zhou, Li-Peng Zhu, Bin Hu, Song Deng, Yan Song, Hongbin Qiu and Sen Pan
The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used. However, these algori...
ver más
|
|
|
|
|
|