Collaborative control of autonomous swarms with resource constraints
by Xi, Wei, Ph.D., UNIVERSITY OF MARYLAND, COLLEGE PARK, 2006, 158 pages; 3241501

Abstract:

This dissertation focuses on the collaborative control of homogeneous UAV swarms. A two-level scheme is proposed by combining the high-level path planning and the low-level vehicle motion control. A decentralized artificial potential function (APF) based approach, which mimics the bacteria foraging process, is studied for the high-level path planning. The deterministic potential based approach, however, suffers from the local minima entrapment dilemma, which motivate us to fix the "flaw" that is naturally embedded. An innovative decentralized stochastic approach based on the Markov Random Filed (MRF) theory is proposed; this approach traditionally used in statistical mechanics and in image processing. By modeling the local interactions as Gibbs potentials, the movements of vehicles are then decided by using Gibbs sampler based simulated annealing (SA) algorithm.

A two-step sampling scheme is proposed to coordinate vehicle networks: in the first sampling step, a vehicle is picked through a properly designed, configuration-dependent proposal distribution, and in the second sampling step, the vehicle makes a move by using the local characteristics of the Gibbs distribution. Convergence properties are established theoretically and confirmed with simulations. In order to reduce the communication cost and the delay, a fully parallel sampling algorithm is studied and analyzed accordingly. In practice, the stochastic nature of the proposed algorithm might lead to a high traveling cost. To mitigate this problem, a hybrid algorithm is developed by combining the Gibbs sampler based method with the deterministic gradient-flow method to gain the advantages of both approaches.

The robustness of the Gibbs sampler based algorithm is also studied. The convergence properties are investigated for different types sensor errors including range-error and random-error. Error bounds are derived to guarantee the convergence of the stochastic algorithm.

In the low-level motion control module, a model predictive control (MPC) approach is investigated for car-like UAV model. Multiple control objectives, for example, minimizing tracking error, avoiding actuator/state saturation, and minimizing control effort, are easily encoded in the objective function. Two numerical optimization approaches, gradient descendent approach and dynamic programming approach, are studied to strike the balance between computation time and complexity.

 
AdviserJohn S. Baras
SchoolUNIVERSITY OF MARYLAND, COLLEGE PARK
SourceDAI/B 67-11, p. , Feb 2007
Source TypeDissertation
SubjectsRobotics
Publication Number3241501
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3241501
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.