| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000434433 |
| 005 | | 20200226150810 |
| 008 | | 200131s2019 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781687927491 |
| 035 | |
▼a (MiAaPQ)AAI27536104 |
| 035 | |
▼a (MiAaPQ)umichrackham002286 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 629.8 |
| 100 | 1 |
▼a Marcotte, Ryan J. |
| 245 | 10 |
▼a Adaptive Communication for Mobile Multi-Robot Systems. |
| 260 | |
▼a [S.l.]:
▼b University of Michigan.,
▼c 2019. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2019. |
| 300 | |
▼a 113 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-04, Section: B. |
| 500 | |
▼a Advisor: Olson, Edwin. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of Michigan, 2019. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 506 | |
▼a This item must not be added to any third party search indexes. |
| 520 | |
▼a Mobile multi-robot systems can be immensely powerful, serving as force multipliers for human operators in search-and-rescue operations, urban reconnaissance missions, and more. Key to fulfilling this potential is robust communication, which allows robots to share sensor data or inform others of their intentions. However, wireless communication is often unreliable for mobile multi-robot systems, exhibiting losses, delays, and outages as robots move through their environment. Furthermore, the wireless communication spectrum is a shared resource, and multi-robot systems must determine how to use its limited bandwidth in accomplishing their missions.This dissertation addresses the challenges of inter-robot communication in two thrusts. In the first thrust, we improve the reliability of such communication through the application of a technique we call Adaptive Erasure Coding (AEC). Erasure codes enable recovery from packet loss through the use of redundancy. Conditions in a mobile robotic network are continually changing, so AEC varies the amount of redundancy applied to achieve a probabilistic delivery guarantee.In the second thrust, we describe a mechanism by which robots can make communication decisions by considering the expected effect of a proposed communication action on team performance. We call this algorithm Optimizing Communication under Bandwidth Constraints (OCBC). Given a finite amount of available bandwidth, OCBC optimizes the contents of a message to respect the bandwidth constraint. |
| 590 | |
▼a School code: 0127. |
| 650 | 4 |
▼a Computer science. |
| 650 | 4 |
▼a Robotics. |
| 690 | |
▼a 0771 |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a University of Michigan.
▼b Computer Science & Engineering. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-04B. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0127 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2019 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15494188
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1008102 |
| 991 | |
▼a E-BOOK |