Stanford Libraries Stanford Libraries
Login My Account Feedback
Reporting from:
Check system status

(Stanford users can avoid this Captcha by logging in.)

Cancel

SearchWorks catalog

Home
Select search scope, currently: catalog
  • all catalog, articles, website, & more in one search
  • catalog books, media & more in the Stanford Libraries' collections
  • articles+ journal articles & other e-resources
  • Help
    • Need help?
      • Chat with us (limited to Stanford community)
      • Email a reference question
      • Find a subject specialist
      • Using SearchWorks
    • Connection
      • Connect to e-resources
      • Report a connection problem
    • If we don't have it
      • Interlibrary borrowing
      • Suggest a purchase (limited to Stanford community)
    • System status
  • Advanced search
  • Course reserves
  • Selections (0)
    • Clear all lists
Reporting from:
Check system status

(Stanford users can avoid this Captcha by logging in.)

Cancel

Librarian View

Last updated in SearchWorks on May 15, 2022 5:46pm

LEADER 04425nam a22003613i 4500
001 a12741597
003 SIRSI
005 20220514050002.0
006 m d
007 cr un
008 180828t20182018cau om 000 0 eng d
040
  
  
a| CSt b| eng e| rda c| CSt
100
1
  
a| Ichter, Brian, e| author. ?| UNAUTHORIZED
245
1
0
a| Massive parallelism and sampling strategies for robust and real-time robotic motion planning / c| Brian Ichter.
264
  
1
a| [Stanford, California] : b| [Stanford University], c| 2018.
264
  
4
c| ©2018
300
  
  
a| 1 online resource.
336
  
  
a| text 2| rdacontent
337
  
  
a| computer 2| rdamedia
338
  
  
a| online resource 2| rdacarrier
500
  
  
a| Submitted to the Department of Aeronautics and Astronautics.
502
  
  
g| Thesis b| Ph.D. c| Stanford University d| 2018.
520
3
  
a| Motion planning is a fundamental problem in robotics, whereby one seeks to compute a low-cost trajectory from an initial state to a goal region that avoids any obstacles. Sampling-based motion planning algorithms have emerged as an effective paradigm for planning with complex, high-dimensional robotic systems. These algorithms maintain only an implicit representation of the state space, constructed by sampling the free state space and locally connecting samples (under the supervision of a collision checking module). This thesis presents approaches towards enabling real-time and robust sampling-based motion planning with improved sampling strategies and massive parallelism. In the first part of this thesis, we discuss algorithms to leverage massively parallel hardware (GPUs) to accelerate planning and to consider robustness during the planning process. We present an algorithm capable of planning at rates amenable to application within control loops, ∼10 ms. This algorithm uses approximate dynamic programming to explore the state space in a massively-parallel, near-optimal manner. We further present two algorithms capable of real-time, uncertainty-aware and perception-aware motion planning that exhaustively explore the state space via a multiobjective search. This search identifies a Pareto set of promising paths (in terms of cost and robustness) and certifies their robustness via Monte Carlo methods. We demonstrate the effectiveness of these algorithm in numerical simulations and a physical experiment on a quadrotor. In the second part of this thesis, we examine sampling-strategies for probing the state space; traditionally this has been uniform, independent, and identically distributed (i.i.d.) random points. We present a methodology for biasing the sample distribution towards regions of the state space in which the solution trajectory is likely to lie. This distribution is learned via a conditional variational autoencoder, allowing a general methodology, which can be used in combination with any sampling- based planner and can effectively exploit the underlying structure of a planning problem while maintaining the theoretical guarantees of sampling-based approaches. We also analyze the use of deterministic, low-dispersion samples instead of i.i.d. random points. We show that this allows deterministic asymptotic optimality (as opposed to probabilistic), a convergence rate bound in terms of the sample dispersion, reduced computational complexity, and improved practical performance. The technical approaches in this work are applicable to general robotic systems and lay the foundations of robustness and algorithmic speed required for robotic systems operating in the world.
700
1
  
a| Pavone, Marco, d| 1980- e| degree supervisor. 4| ths 0| http://id.loc.gov/authorities/names/no2012120124 =| ^A2985500
700
1
  
a| Olukotun, Oyekunle Ayinde e| degree committee member. 4| ths 0| http://id.loc.gov/authorities/names/no2007156893 =| ^A2088134
700
1
  
a| Rock, Stephen M. e| degree committee member. 4| ths 0| http://id.loc.gov/authorities/names/no2010078141 =| ^A2485258
710
2
  
a| Stanford University. b| Department of Aeronautics and Astronautics. 0| http://id.loc.gov/authorities/names/n82229395 =| ^A337725
596
  
  
a| 21 22
035
  
  
a| (OCoLC-M)1050752173
856
4
0
u| http://purl.stanford.edu/xm179nc3440 x| SDR-PURL x| item
916
  
  
a| DATE CATALOGED b| 20180830
999
  
  
a| 3781 2018 I w| ALPHANUM c| 1 i| 36105227900466 l| UARCH-30 m| SPEC-COLL r| Y s| Y t| NONCIRC u| 8/29/2018
999
  
  
a| INTERNET RESOURCE w| ASIS c| 1 i| 12741597-2001 l| INTERNET m| SUL r| Y s| Y t| SUL u| 8/29/2018 x| E-THESIS
Stanford Libraries
  • Hours & locations
  • My Account
  • Ask us
  • Opt out of analytics
  • System status
Stanford University
  • Stanford Home
  • Maps & Directions
  • Search Stanford
  • Emergency Info
  • Terms of Use
  • Privacy
  • Copyright
  • Trademarks
  • Non-Discrimination
  • Accessibility

© Stanford University, Stanford, California 94305.