Skip to main navigation
Skip to search
Skip to main content
Arizona State University Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Datasets
Prizes
Search by expertise, name or affiliation
Robust shortest path planning and semicontractive dynamic programming
Dimitri P. Bertsekas
Research output
:
Contribution to journal
›
Article
›
peer-review
8
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Robust shortest path planning and semicontractive dynamic programming'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Path Planning
100%
Shortest path
69%
Dynamic Programming
65%
Uncertainty
55%
Pursuit-evasion
51%
Model Predictive Control
48%
Policy Iteration
47%
Value Iteration
46%
Optimality Equation
46%
Optimal Path
45%
Shortest Path Problem
41%
Arc length
40%
Programming Model
38%
Dynamic Model
34%
Planning
33%
Existence and Uniqueness of Solutions
31%
Minimax
31%
Directed Graph
30%
Costs
23%
Non-negative
22%
Path
22%
Formulation
20%
Context
20%
Vertex of a graph
18%
Business & Economics
Shortest Path
89%
Dynamic Programming
64%
Planning
53%
Model Predictive Control
49%
Shortest Path Problem
48%
Directed Graph
47%
Optimal Path
43%
Evasion
41%
Optimality
41%
Minimax
40%
Uncertainty
38%
Uniqueness
31%
Node
31%
Guarantee
26%
Destination
25%
Costs
12%
Engineering & Materials Science
Dynamic programming
63%
Motion planning
62%
Uncertainty
41%
Directed graphs
38%
Model predictive control
32%
Costs
12%