The combination of a global routing algorithm and a path-finding algorithm for an unmanned moving vehicle.
Floom, Marvin Hubert Jr.
Kirk, Donald E.
MetadataShow full item record
In future space missions it is planned that an unmanned robot will be sent to explore the other planets' surface. Control of the vehicle from earth is unrealistic because of the long delay time in the transmission of data, From a gross knowledge of the terrain a global routing algorithm can be used to find an optimal path from one point to another. A survey was undertaken to find an algorithm best suited for this use. Dynamic programming was selected and in combination with Lim's path-finding algorithm proved to be successful in simulated vehicle explorations over terrain represented by Gaussian density functions.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Tan, Ko-Cheng (Monterey, California. Naval Postgraduate School, 1996-06);Motion planning and control of a Nomad 200 mobile robot are studied in this thesis. The objective is to develop a motion planning and control algorithm that is able to move the robot from an initial configuration (position ...