|
|
|
|
|
Sílvia de Castro Pereira, Eduardo J. Solteiro Pires and Paulo B. de Moura Oliveira
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keepin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mao Nishira, Satoshi Ito, Hiroki Nishikawa, Xiangbo Kong and Hiroyuki Tomiyama
Delivery drones have been attracting attention as a means of solving recent logistics issues, and many companies are focusing on their practical applications. Many research studies on delivery drones have been active for several decades. Among them, exte...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shaolong Yang, Jin Huang, Weichao Li and Xianbo Xiang
A growing number of researchers are interested in deploying unmanned surface vehicles (USVs) in support of ocean environmental monitoring. To accomplish these missions efficiently, multiple-waypoint path planning strategies for survey USVs are still a ke...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shuzhen Yang, Bocai Jia, Tao Yu and Jin Yuan
In view of the difficulties of fruit cluster identification, the specific harvesting sequence constraints of aggregated fruits, and the balanced harvesting task assignment for the multiple arms with a series-increasing symmetric shared (SISS) region, thi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andrei Gorchakov
Pág. 1 - 5
When developing parallel methods for solving many numerical methods for solving applied problems, in particular the branch-and-bound method, the problem of load balancing arises. The choice of implementation options at the moment has been proposed quite ...
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
|
|
|
|
|
|
|
|
|
|
|
Jinjin Yan, Sisi Zlatanova, Jinwoo (Brian) Lee and Qingxiang Liu
With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Umberto Junior Mele, Luca Maria Gambardella and Roberto Montemanni
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anugrah K. Pamosoaji and Djoko Budiyanto Setyohadi
In this paper, a novel graph model to figure Collision-Free Multiple Traveling Salesman Problem (CFMTSP) is proposed. In this problem, a group of vehicles start from different nodes in an undirected graph and must visit each node in the graph, following ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Uthman Baroudi, Mohammad Alshaboti, Anis Koubaa and Sahar Trigui
In this paper, we address the problem of online dynamic multi-robot task allocation (MRTA) problem. In the existing literature, several works investigated this problem as a multi-objective optimization (MOO) problem and proposed different approaches to s...
ver más
|
|
|
|
|
|