본문

서브메뉴

Multi-Agent Motion Planning for Collaborative and Large-Scale Applications.
내용보기
Multi-Agent Motion Planning for Collaborative and Large-Scale Applications.
자료유형  
 학위논문
Control Number  
0017163943
International Standard Book Number  
9798346567592
Dewey Decimal Classification Number  
629.8
Main Entry-Personal Name  
Zhang, Tianpeng.
Publication, Distribution, etc. (Imprint  
[S.l.] : Harvard University., 2024
Publication, Distribution, etc. (Imprint  
Ann Arbor : ProQuest Dissertations & Theses, 2024
Physical Description  
158 p.
General Note  
Source: Dissertations Abstracts International, Volume: 86-05, Section: B.
General Note  
Advisor: Li, Na.
Dissertation Note  
Thesis (Ph.D.)--Harvard University, 2024.
Summary, Etc.  
요약Integrating multirobot systems into applications such as automated warehouses, environmental monitoring, and other complex domains has revolutionized various aspects of the modern world. These systems, however, bring forth significant challenges. One of the primary challenges in multirobot systems is enabling decentralized collaboration. In scenarios where robots must operate independently without a central controller, achieving effective coordination becomes difficult due to limited global information, communication constraints, and the dynamic nature of the environment. Another significant challenge lies in the motion planning of a large number of robots in continuous environments. As the number of robots increases, so does the complexity of finding safe and efficient trajectories through dynamic, obstacle-laden spaces.This dissertation focuses on creating practical solutions to address these challenges, which are crucial for effectively deploying multirobot systems in real-world environments. To tackle decentralized collaboration, this work develops a consensus based approach that enables robots to coordinate effectively despite limited global information and communication constraints. To ensure safety and efficient planning in the continuous environment, this dissertation introduces a Mixed Integer Linear Programming (MILP) framework and techniques that improve its computational efficiency. A novel hybrid graph representation of the environments is proposed to achieve faster computation than fully continuous planning, and a safe-interval motion planning algorithm is designed. To manage a large number of agents in the continuous space, a traffic-aware two level strategy is developed. The effectiveness of these methods is demonstrated through extensive simulations and real-world experiments, proving their potential for collaborative and largescale applications.The structure of the dissertation is as follows:Chapter 1 introduces the key challenges in multiagent motion planning and decentralized collaboration, outlining the motivation behind the research and its relevance to real-world applications.Chapter 2 introduces a consensus-based framework that allows robots to collaborate effectively without relying on a central controller. This framework employs distributed estimation and control techniques, enabling each robot to make decisions based on local information while contributing to the overall system's goals. The chapter demonstrates the effectiveness of the proposed method through simulations and real-world experiments.Chapter 3 presents a mixed-integer linear programming (MILP) approach to optimizing the trajectories of multiple robots navigating through environments, ensuring that the generated paths are both safe and efficient. This chapter also introduces techniques to enhance computational efficiency, making the approach feasible for real-time applications in largescale robotic systems.Chapter 4 introduces a hybrid graph-based environment representation that lies between discrete and continuous representations. This hybrid approach leverages the strengths of each representation, allowing for faster computation and more scalable solutions without compromising the quality of the solution.Chapter 5 explores a traffic-aware planning strategy with a dual-level approach. High-level planning minimizes congestion by intelligently routing robots through the environment, while low-level tracking ensures precise and collision-free movement. Simulations demonstrate the effectiveness of this method in 100-agent experiments.
Subject Added Entry-Topical Term  
Robotics.
Subject Added Entry-Topical Term  
Engineering.
Subject Added Entry-Topical Term  
Applied mathematics.
Index Term-Uncontrolled  
Automated warehouses
Index Term-Uncontrolled  
Environmental monitoring
Index Term-Uncontrolled  
Integrating multi­robot systems
Index Term-Uncontrolled  
Mixed ­Integer Linear Programming
Index Term-Uncontrolled  
Traffic­-aware planning
Added Entry-Corporate Name  
Harvard University Engineering and Applied Sciences - Applied Math
Host Item Entry  
Dissertations Abstracts International. 86-05B.
Electronic Location and Access  
로그인을 한후 보실 수 있는 자료입니다.
Control Number  
joongbu:654635
신착도서 더보기
최근 3년간 통계입니다.

소장정보

  • 예약
  • 캠퍼스간 도서대출
  • 서가에 없는 책 신고
  • 나의폴더
소장자료
등록번호 청구기호 소장처 대출가능여부 대출정보
TQ0030557 T   원문자료 열람가능/출력가능 열람가능/출력가능
마이폴더 부재도서신고

* 대출중인 자료에 한하여 예약이 가능합니다. 예약을 원하시면 예약버튼을 클릭하십시오.

해당 도서를 다른 이용자가 함께 대출한 도서

관련도서

관련 인기도서

도서위치