國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Collision-Free Task Assignment and T...

Toyoda, Yasuhiro.

Collision-Free Task Assignment and Trajectory Planning for Multi-Robot Systems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Collision-Free Task Assignment and Trajectory Planning for Multi-Robot Systems.
作者:	Toyoda, Yasuhiro.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2020
面頁冊數:	76 p.
附註:	Source: Masters Abstracts International, Volume: 82-02.
附註:	Advisor: Martinez, Sonia.
Contained By:	Masters Abstracts International82-02.
標題:	Robotics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27995757
ISBN:	9798662451834

Collision-Free Task Assignment and Trajectory Planning for Multi-Robot Systems.
Toyoda, Yasuhiro.

Collision-Free Task Assignment and Trajectory Planning for Multi-Robot Systems. - Ann Arbor : ProQuest Dissertations & Theses, 2020 - 76 p.

Source: Masters Abstracts International, Volume: 82-02.

Thesis (M.S.)--University of California, San Diego, 2020.

This item must not be sold to any third party vendors.

In this paper, we address the problem of assigning tasks and generating trajectories in a collision-free manner for multi-robot systems moving along a predefined roadmap. First, we propose centralized algorithms, which assign tasks to minimize the total travel distance or the collisions and then resolve the collisions with replanning the trajectory by local graph modification. Especially, to minimize the collisions in the initial task assignment, we formulate an optimization problem whose objective function includes the number of collisions based on a conflict graph that encodes all possible collisions among the system. We also develop a method to resolve remaining collisions in the initial task assignment. In this method, each robot has a graph representing the roadmap, which is used to generate its trajectory. When a collision occurs on the trajectory, the robot modifies the graph to regenerate the trajectory that resolves the collision.We then propose several decentralized algorithms, extending the centralized methods, which assign tasks initially before robots start moving in such a way to minimize the total travel distance, minimize collisions, or deploy randomly, and then avoid collisions with local graph modification. In the initial task assignment minimizing collisions, each robot calculates the expected value of collisions based on the local conflict graph, which encodes possible collisions among the neighborhood and choose a task to minimize the expectation while coordinating to resolve a conflict of the assignment with the neighborhood.The paper finally reports on simulations for systems of several tens of robots to evaluate the performance of the proposed centralized and decentralized algorithms.

ISBN: 9798662451834Subjects--Topical Terms:

181952
Robotics.
Subjects--Index Terms:

Centralized algorithm

Collision-Free Task Assignment and Trajectory Planning for Multi-Robot Systems.
LDR:02917nmm a2200373 4500 001 594576
005 20210521101659.5
008 210917s2020 ||||||||||||||||| ||eng d
020 $a 9798662451834
035 $a (MiAaPQ)AAI27995757
035 $a AAI27995757
040 $a MiAaPQ $c MiAaPQ
100 1 $a Toyoda, Yasuhiro. $3 886593
245 1 0 $a Collision-Free Task Assignment and Trajectory Planning for Multi-Robot Systems.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2020
300 $a 76 p.
500 $a Source: Masters Abstracts International, Volume: 82-02.
500 $a Advisor: Martinez, Sonia.
502 $a Thesis (M.S.)--University of California, San Diego, 2020.
506 $a This item must not be sold to any third party vendors.
520 $a In this paper, we address the problem of assigning tasks and generating trajectories in a collision-free manner for multi-robot systems moving along a predefined roadmap. First, we propose centralized algorithms, which assign tasks to minimize the total travel distance or the collisions and then resolve the collisions with replanning the trajectory by local graph modification. Especially, to minimize the collisions in the initial task assignment, we formulate an optimization problem whose objective function includes the number of collisions based on a conflict graph that encodes all possible collisions among the system. We also develop a method to resolve remaining collisions in the initial task assignment. In this method, each robot has a graph representing the roadmap, which is used to generate its trajectory. When a collision occurs on the trajectory, the robot modifies the graph to regenerate the trajectory that resolves the collision.We then propose several decentralized algorithms, extending the centralized methods, which assign tasks initially before robots start moving in such a way to minimize the total travel distance, minimize collisions, or deploy randomly, and then avoid collisions with local graph modification. In the initial task assignment minimizing collisions, each robot calculates the expected value of collisions based on the local conflict graph, which encodes possible collisions among the neighborhood and choose a task to minimize the expectation while coordinating to resolve a conflict of the assignment with the neighborhood.The paper finally reports on simulations for systems of several tens of robots to evaluate the performance of the proposed centralized and decentralized algorithms.
590 $a School code: 0033.
650 4 $a Robotics. $3 181952
650 4 $a Computer engineering. $3 212944
650 4 $a Applied mathematics. $3 377601
653 $a Centralized algorithm
653 $a Collision avoidance
653 $a Decentralized algorithm
653 $a Multi-robot trajectory planning
653 $a Task assignment
690 $a 0771
690 $a 0464
690 $a 0364
710 2 $a University of California, San Diego. $b Mechanical and Aerospace Engineering. $3 886594
773 0 $t Masters Abstracts International $g 82-02.
790 $a 0033
791 $a M.S.
792 $a 2020
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=27995757