UMD Theses and Dissertations

Permanent URI for this collectionhttp://hdl.handle.net/1903/3

New submissions to the thesis/dissertation collections are added automatically as they are received from the Graduate School. Currently, the Graduate School deposits all theses and dissertations from a given semester after the official graduation date. This means that there may be up to a 4 month delay in the appearance of a given thesis/dissertation in DRUM.

More information is available at Theses and Dissertations at University of Maryland Libraries.

Browse

Filters

20051

Settings

Author: search.filters.author.Shao, ChengSubject: search.filters.subject.cooperative control

Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Biologically-inspired optimal control
    (2005-11-14) Shao, Cheng; Hristu, Dimitrios; Mechanical Engineering; Digital Repository at the University of Maryland; University of Maryland (College Park, Md.)
    Inspired by the collective activities of ant colonies, and by their ability to gradually optimize their foraging trails, this dissertation investigates the cooperative solution of a broad class of trajectory optimization problems with various types of boundary conditions. A set of cooperative control algorithms are presented and proved to converge to an optimal solution by iteratively optimizing an initially feasible trajectory/control pair. The proposed algorithms organize a group of identical control systems by imposing a type of pair-wise interaction known as "local pursuit". The bio-inspired approach taken here requires only short-range, limited interactions between group members, avoids the need for a "global map" of the environment in which the group evolves, and solves an optimal control problem in "small" pieces, in a manner which is made precise. These features enable the application of the proposed algorithms in numerical optimization, leading to an increase of the permitting size of problems that can be solved, as well as a decrease of numerical errors incurred in ill-conditioned problems. The algorithms' effectiveness is illustrated in a series of simulations and laboratory experiments