rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Using spheres to improve motion planning algorithms
  name:
    name part: Miller, Shawna Lynn.
    role:
      role term: creator
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: xx
    date issued: 2001
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: ix, 26 leaves : illustrations ; 28 cm.
  abstract: Motion planning algorithms aim to solve the problem of finding a collision-free path to move an object between start and goal positions in an environment. An environment consists of obstacles that the object must avoid. A useful abstraction is the object's configuration space (C-space). Each point in the C-space represents a unique position and orientation of the object in the environment. A valid point is a configuration where the object is not colliding with itself or an obstacle. The C-space consists of all possible positions and orientations, valid or not. Although the robot is simplified to a single point, the obstacles become very complicated in the C-space. It is too expensive to compute them. Probabilistic roadmap methods are one type of method to solve motion planning problems. They use randomization to overcome this difficulty. The roadmap represents collision-free paths that the object can navigate. The basic probabilistic roadmap method generates nodes through uniform random sampling in the C-space. Variations of the probabilistic roadmap method use different methods to generate and connect roadmap nodes. Probabilistic roadmaps work well in many applications, but in some situations they can by inefficient and unsuccessful. Our research provides an optimization of theses algorithms using C-space spheres. Spheres, centered at each configuration in the roadmap, define free areas of the C-space. The radius of a sphere is the node's C-space clearance. Intersecting spheres identify good pairs of nodes for connection. Since an edge connecting the two nodes lies entirely inside both spheres, it is automatically known to be collision-free. C-space obstacles are not explicitly computed, so the C-space clearance must be approximated. Intersecting spheres no longer identify collision-free edges but now only likely edges. Verifying that the edge is valid can be postponed until query time. In practice, most edges identified by intersecting spheres are collision-free. …
  note: by Shawna Lynn Miller.
  note: Vita.
  note: "Major Subject: Computer Science".
  note: Fellows Thesis Texas A&M University 2001.
  note: Includes bibliographical references (leaves 24-25).
  subject:
    topic: Major computer science
  identifier: http://hdl.handle.net/1969.1/ETD-TAMU-2001-Fellows-Thesis-M5557
  related item:
    location:
      url: http://hdl.handle.net/1969.1/ETD-TAMU-2001-Fellows-Thesis-M5557
  record info:
    record content source: TXA
    record creation date: 020108
    record change date: 20151023111037.0
    record identifier: in00001647869