article · 2011

Motivation Problem Formulation Shortest Path Problem (SPP)

Dmitry Yershov, Steve Lavalle

Cited by 0Abstract and details only

Abstract

X f ree xI • Work or configuration space Rn • Polyhedral obstacles Xobs ⊂ Rn Xfree = Rn \\Xobs (N vertices) • Goal set Xgoal ⊂ Xfree • Initial configuration xI ∈ Xfree • Find the shortest path x ̃ : [0, 1] → Xfree • 2D problem can be solved in N log(N) time [Hershberger and Suri, 1999] • 3D problem is NP-hard

Cite this paper

APA 7

Yershov, D., & Lavalle, S. (2011). Motivation Problem Formulation Shortest Path Problem (SPP).

MLA 9

Yershov, Dmitry, and Steve Lavalle. “Motivation Problem Formulation Shortest Path Problem (SPP).” 2011.

Chicago

Yershov, Dmitry, and Steve Lavalle. 2011. “Motivation Problem Formulation Shortest Path Problem (SPP).”

Harvard

Yershov, D. and Lavalle, S. (2011) ‘Motivation Problem Formulation Shortest Path Problem (SPP)’.

BibTeX

@article{yershov2011motivation,
  title = {{Motivation Problem Formulation Shortest Path Problem (SPP)}},
  author = {Yershov, Dmitry and Lavalle, Steve},
  year = {2011}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.