Anthony Stentz

Anthony Stentz

Auto-generated profile, based on publicly available information

Anthony Stentz

Robotics Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2006 in Journal of Field Robotics
Verified
Journal Article
Closed access
PDF file
DFDave Ferguson
Dave Ferguson
ASAnthony Stentz
Anthony Stentz

1 October 2006
Verified
Conference Paper
Closed access
DFDave Ferguson
Dave Ferguson
ASAnthony Stentz
Anthony Stentz
We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of rapidly-exploring random trees (RRTs), where each tree reuses information from previous trees to improve its growth and the quality of its resulting path. We also present a number of modifications to the RRT algorithm that we use to bias the search in favor of less costly solutions. The resulting approach is able to produce an initial solution very quickly, then improve the quality of this solution while deliberation time allows. It is also able to guarantee that subsequent solutions will be better than all previous ones by a user-defined improvement bound. We demonstrate the effectiveness of the algorithm on both single robot and multirobot planning domains

1 January 2007
Verified
Conference Paper
Closed access
JCJoseph Carsten
Joseph Carsten
ARArturo Rankin
Arturo Rankin
DFDave Ferguson
Dave Ferguson
ASAnthony Stentz
Anthony Stentz
In January 2004, NASA's twin Mars exploration rovers (MERs), spirit and opportunity, began searching the surface of Mars for evidence of past water activity. In order to localize and approach scientifically interesting targets, the rovers employ an on-board navigation system. Given the latency in sending commands from Earth to the Martian rovers (and in receiving return data), a high level of navigational autonomy is desirable. Autonomous navigation with hazard avoidance (AutoNav) is currently performed using a local path planner called GESTALT (grid-based estimation of surface traversability applied to local terrain). GESTALT uses stereo cameras to evaluate terrain safety and avoid obstacles. GESTALT works well to guide the rovers around narrow and isolated hazards, however, it is susceptible to failure when clusters of closely spaced, non-traversable rocks form extended obstacles. In May 2005, a new technology task was initiated at the Jet Propulsion Laboratory to address this limitation. A version of the Carnegie Mellon University Field D* global path planner has been integrated into MER flight software, enabling simultaneous local and global planning during AutoNav. A revised version of AutoNav was uploaded to the rovers during the summer of 2006. This paper describes how global planning was integrated into the MER flight software, and presents results of testing the improved AutoNav system using the MER Surface System TestBed rover.

23 February 2009 in Journal of Field Robotics
Verified
Journal Article
Closed access
PDF file
JCJoseph Carsten
Joseph Carsten
ARArturo Rankin
Arturo Rankin
DFDave Ferguson
Dave Ferguson
ASAnthony Stentz
Anthony Stentz

16 February 2017 in Journal of Field Robotics
Verified
Journal Article
Closed access
PDF file
GHG. Clark Haynes
G. Clark Haynes
DSDavid Stager
David Stager
ASAnthony Stentz
Anthony Stentz
JWJ. Michael Vande Weghe
J. Michael Vande Weghe
BZBrian Zajac
Brian Zajac
RWRandy Warner
Randy Warner

1 April 2007 in Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164)
Verified
Conference Paper
Closed access
DFDave Ferguson
Dave Ferguson
ASAnthony Stentz
Anthony Stentz
We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time by generating a series of solutions, each guaranteed to be better than the previous ones by a user-defined improvement bound. When updated information regarding the underlying search space is received, the algorithm efficiently repairs its previous solution. The result is an approach that provides low-cost solutions to high-dimensional search problems involving partially-known or dynamic environments. We discuss theoretical properties of the algorithm, provide experimental results on a simulated multirobot planning scenario, and present an implementation on a team of outdoor mobile robots