Demo Data from EDBT 2026 / reviewers in the wild / expert
Yoke Peng Leong
dblp:135/5569
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0001-8560-8856ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 · 100% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Motion planning and robot control
motion planning |
0.4 | 1 | 2019 | Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement · ICRA 2019 |
Robotics › Motion planning and robot control › motion planning › optimal motion planning
optimal path planning |
0.4 | 1 | 2019 | Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement · ICRA 2019 |
Automata and formal languages › regular games
ω-regular objectives |
0.4 | 1 | 2019 | Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement · ICRA 2019 |
Methods — techniques the papers use, named apart from their topics
abstraction refinement · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement
Yoke Peng Leong, Pavithra Prabhakar |
ICRA | 1 |
| 2016 | Sequential alternating least squares for solving high dimensional linear Hamilton-Jacobi-Bellman equationabstractThis paper presents a technique to efficiently solve the Hamilton-Jacobi-Bellman (HJB) equation for a class of stochastic affine nonlinear dynamical systems in high dimensions. The HJB solution provides a globally optimal controller to the associated dynamical system. However, the curse of dimensionality, commonly found in robotic systems, prevents one from solving the HJB equation naively. This work avoids the curse by representing the linear HJB equation using tensor decomposition. An alternating least squares (ALS) based technique finds an approximate solution to the linear HJB equation. A straightforward implementation of the ALS algorithm results in ill-conditioned matrices that prevent approximation to a high order of accuracy. This work resolves the ill-conditioning issue by computing the solution sequentially and introducing boundary condition rescaling. Both of these additions reduce the condition number of matrices in the ALS-based algorithm. A MATLAB tool, Sequential Alternating Least Squares (SeALS), that implements the new method is developed. The performance of SeALS is illustrated using three engineering examples: an inverted pendulum, a Vertical Takeoff and Landing aircraft, and a quadcopter with state up to twelve. Elis Stefansson, Yoke Peng Leong |
IROS | 2 |
| 2013 | Feature Localization Using Kinematics and Impulsive Hybrid OptimizationabstractThis paper focuses on detecting and localizing a surface feature on an otherwise uniform surface using kinematic data collected during an exploratory procedure. Assuming that characteristics of the feature shape and surface shape are known, a surface feature is detected by performing least squares estimation calculated via impulsive hybrid system optimization. The optimization routine is based on an adjoint formulation which allows the algorithm to be computationally efficient and scalable. This algorithm is also shown to perform well with the presence of measurement noise and model noise, both in simulations and experiments. Yoke Peng Leong, Todd D. Murphey |
IEEE Trans Autom. Sci. Eng. | 1 |