Roland B. Ilyes

dblp:324/2055 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2023
0009-0004-9241-4362ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Theory of computation · 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
2 papers
Motion planning and robot control · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › motion planning › motion planning under uncertainty
chance-constrained planning
0.712023
Chance-Constrained Motion Planning with Event-Triggered Estimation · ICRA 2023
Robotics › Motion planning and robot control
motion planning
0.712023
Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic · ICRA 2023
Robotics › Motion planning and robot control › motion planning
motion planning under uncertainty
0.712023
Chance-Constrained Motion Planning with Event-Triggered Estimation · ICRA 2023
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning
0.712023
Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic · ICRA 2023
Robotics › Motion planning and robot control
temporal logic specification
0.712023
Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic · ICRA 2023
Internet of things and sensor networks
wireless sensor network
0.712023
Chance-Constrained Motion Planning with Event-Triggered Estimation · ICRA 2023
Logic in computer science › temporal logic
signal temporal logic
0.212023
Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic · ICRA 2023
Logic in computer science
temporal logic
0.212023
Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic · ICRA 2023

Methods — techniques the papers use, named apart from their topics

stochastic robustness measure · 1.3sampling-based planning · 1.3distribution propagation · 1.3chance constraints · 1.3STL monitor · 1.3probabilistic completeness proofs · 0.7probabilistic completeness proof · 0.7
YearPublicationVenuePosition
2023 Poster Abstract: Sampling-based Approach to Robust STL Synthesis for Complex Systems under Uncertainty
abstract
No abstract available.
Qi Heng Ho, Roland B. Ilyes, Zachary Sunberg, Morteza Lahijanian
HSCC2
2023 Stochastic Robustness Interval for Motion Planning with Signal Temporal Logic
abstract
In this work, we present a novel robustness measure for continuous-time stochastic trajectories with respect to Signal Temporal Logic (STL) specifications. We show the soundness of the measure and develop a monitor for reasoning about partial trajectories. Using this monitor, we introduce an STL sampling-based motion planning algorithm for robots under uncertainty. Given a minimum robustness requirement, this algorithm finds satisfying motion plans; alternatively, the algorithm also optimizes for the measure. We prove probabilistic completeness and asymptotic optimality of the motion planner with respect to the measure, and demonstrate the effectiveness of our approach on several case studies.
Roland B. Ilyes, Qi Heng Ho, Morteza Lahijanian
ICRA1
2023 Chance-Constrained Motion Planning with Event-Triggered Estimation
abstract
We consider the problem of motion and communication planning under uncertainty with limited information from a remote sensor network. Because the remote sensors are power and bandwidth limited, we use event-triggered (ET) estimation to manage communication costs. We introduce a fast and efficient sampling-based planner which computes motion plans coupled with ET communication strategies that minimize communication costs, while satisfying constraints on the probability of reaching the goal region and the point-wise probability of collision. We derive a novel method for offline propagation of the expected state distribution, and corresponding bounds on this distribution. These bounds are used to evaluate the chance constraints in the algorithm. Case studies establish the validity of our approach and demonstrate computational efficiency and asymptotic optimality of the planner.
Anne Theurkauf, Qi Heng Ho, Roland B. Ilyes, Nisar R. Ahmed, Morteza Lahijanian
ICRA3