Picture for Aditya Mandalika

Aditya Mandalika

Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning

Apr 11, 2021
Figure 1 for Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning
Figure 2 for Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning
Figure 3 for Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning
Figure 4 for Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning
Viaarxiv icon

Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges

Mar 20, 2020
Figure 1 for Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges
Figure 2 for Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges
Figure 3 for Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges
Figure 4 for Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges
Viaarxiv icon

LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planning

Add code
Jul 22, 2019
Figure 1 for LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planning
Figure 2 for LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planning
Figure 3 for LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planning
Figure 4 for LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planning
Viaarxiv icon

Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles

Add code
Apr 08, 2019
Figure 1 for Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles
Figure 2 for Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles
Figure 3 for Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles
Figure 4 for Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles
Viaarxiv icon

Sample-Efficient Learning of Nonprehensile Manipulation Policies via Physics-Based Informed State Distributions

Oct 24, 2018
Figure 1 for Sample-Efficient Learning of Nonprehensile Manipulation Policies via Physics-Based Informed State Distributions
Figure 2 for Sample-Efficient Learning of Nonprehensile Manipulation Policies via Physics-Based Informed State Distributions
Figure 3 for Sample-Efficient Learning of Nonprehensile Manipulation Policies via Physics-Based Informed State Distributions
Figure 4 for Sample-Efficient Learning of Nonprehensile Manipulation Policies via Physics-Based Informed State Distributions
Viaarxiv icon

Bayesian Policy Optimization for Model Uncertainty

Oct 01, 2018
Figure 1 for Bayesian Policy Optimization for Model Uncertainty
Figure 2 for Bayesian Policy Optimization for Model Uncertainty
Figure 3 for Bayesian Policy Optimization for Model Uncertainty
Figure 4 for Bayesian Policy Optimization for Model Uncertainty
Viaarxiv icon

Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges

Add code
Mar 15, 2018
Figure 1 for Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Figure 2 for Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Figure 3 for Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Figure 4 for Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Viaarxiv icon