Luka Antonyshyn

Luka Antonyshyn

Auto-generated profile, based on publicly available information

Luka Antonyshyn

School of Computing, Queen’s University, Kingston, Canada

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 February 2023 in ACM Computing Surveys
Verified
Journal Article
Open access
LALuke Antonyshyn
Luke Antonyshyn
JSJefferson Silveira
Jefferson Silveira
SGSidney Givigi
Sidney Givigi
JMJoshua Marshall
Joshua Marshall
With recent advances in mobile robotics, autonomous systems, and artificial intelligence, there is a growing expectation that robots are able to solve complex problems. Many of these problems require multiple robots working cooperatively in a multi-robot system. Complex tasks may also include the interconnection of task-level specifications with robot motion-level constraints. Many recent works in the literature use multiple mobile robots to solve these complex tasks by integrating task and motion planning. We survey recent contributions to the field of combined task and motion planning for multiple mobile robots by categorizing works based on their underlying problem representations, and we identify possible directions for future research. We propose a taxonomy for task and motion planning based on system capabilities, applicable to multi-robot and single-robot systems.

9 July 2024 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Open access
PDF file
LALuka Antonyshyn
Luka Antonyshyn
SGSidney Givigi
Sidney Givigi
Sparse rewards and sample efficiency are open areas of research in the field of reinforcement learning. These problems are especially important when considering applications of reinforcement learning to robotics and other cyber-physical systems. This is so because in these domains many tasks are goal-based and naturally expressed with binary successes and failures, action spaces are large and continuous, and real interactions with the environment are limited. In this work, we propose Deep Value-and-Predictive-Model Control (DVPMC), a model-based predictive reinforcement learning algorithm for continuous control that uses system identification, value function approximation and sampling-based optimization to select actions. The algorithm is evaluated on a dense reward and a sparse reward task. We show that it can match the performance of a predictive control approach to the dense reward problem, and outperforms model-free and model-based learning algorithms on the sparse reward task on the metrics of sample efficiency and performance. We verify the performance of an agent trained in simulation using DVPMC on a real robot playing the reach-avoid game. Video of the experiment can be found here: https://youtu.be/0Q274kcfn4c.