Demo Data from EDBT 2026 / reviewers in the wild / expert
Ashutosh Chapagain
dblp:339/6732
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Motion planning and robot control · 75% Planning, search and constraint satisfaction · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Motion planning and robot control
differentiable planning |
0.7 | 1 | 2023 | DiSProD: Differentiable Symbolic Propagation of Distributions for Planning · IJCAI 2023 |
Robotics › Motion planning and robot control › trajectory optimization
gradient-based trajectory optimization |
0.7 | 1 | 2023 | DiSProD: Differentiable Symbolic Propagation of Distributions for Planning · IJCAI 2023 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
probabilistic planning |
0.7 | 1 | 2023 | DiSProD: Differentiable Symbolic Propagation of Distributions for Planning · IJCAI 2023 |
Robotics › Motion planning and robot control
trajectory optimization |
0.7 | 1 | 2023 | DiSProD: Differentiable Symbolic Propagation of Distributions for Planning · IJCAI 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | DiSProD: Differentiable Symbolic Propagation of Distributions for PlanningabstractThe paper introduces DiSProD, an online planner developed for environments with probabilistic transitions in continuous state and action spaces. DiSProD builds a symbolic graph that captures the distribution of future trajectories, conditioned on a given policy, using independence assumptions and approximate propagation of distributions. The symbolic graph provides a differentiable representation of the policy's value, enabling efficient gradient-based optimization for long-horizon search. The propagation of approximate distributions can be seen as an aggregation of many trajectories, making it well-suited for dealing with sparse rewards and stochastic environments. An extensive experimental evaluation compares DiSProD to state-of-the-art planners in discrete-time planning and real-time control of robotic systems. The proposed method improves over existing planners in handling stochastic environments, sensitivity to search depth, sparsity of rewards, and large action spaces. Additional real-world experiments demonstrate that DiSProD can control ground vehicles and surface vessels to successfully navigate around obstacles. Palash Chatterjee, Ashutosh Chapagain, Weizhe Chen 0004, Roni Khardon |
IJCAI | 2 |