TY - GEN
T1 - Semantic Abstraction-Guided Motion Planning for scLTL Missions in Unknown Environments
AU - Grover, Kush
AU - Barbosa, Fernando S.
AU - Tumova, Jana
AU - Křetínský, Jan
N1 - Publisher Copyright:
© 2021, MIT Press Journals, All rights reserved.
PY - 2021
Y1 - 2021
N2 - Complex mission specifications can be often specified through temporal logics, such as Linear Temporal Logic and its syntactically co-safe fragment, scLTL. Finding trajectories that satisfy such specifications becomes hard if the robot is to fulfil the mission in an initially unknown environment, where neither locations of regions or objects of interest in the environment nor the obstacle space are known a priori. We propose an algorithm that, while exploring the environment, learns important semantic dependencies in the form of a semantic abstraction, and uses it to bias the growth of an Rapidly-exploring random graph towards faster mission completion. Our approach leads to finding trajectories that are much shorter than those found by the sequential approach, which first explores and then plans. Simulations comparing our solution to the sequential approach, carried out in 100 randomized office-like environments, show more than 50% reduction in the trajectory length.
AB - Complex mission specifications can be often specified through temporal logics, such as Linear Temporal Logic and its syntactically co-safe fragment, scLTL. Finding trajectories that satisfy such specifications becomes hard if the robot is to fulfil the mission in an initially unknown environment, where neither locations of regions or objects of interest in the environment nor the obstacle space are known a priori. We propose an algorithm that, while exploring the environment, learns important semantic dependencies in the form of a semantic abstraction, and uses it to bias the growth of an Rapidly-exploring random graph towards faster mission completion. Our approach leads to finding trajectories that are much shorter than those found by the sequential approach, which first explores and then plans. Simulations comparing our solution to the sequential approach, carried out in 100 randomized office-like environments, show more than 50% reduction in the trajectory length.
UR - http://www.scopus.com/inward/record.url?scp=85126588474&partnerID=8YFLogxK
U2 - 10.15607/RSS.2021.XVII.090
DO - 10.15607/RSS.2021.XVII.090
M3 - Conference contribution
AN - SCOPUS:85126588474
SN - 9780992374778
T3 - Robotics: Science and Systems
BT - Robotics
A2 - Shell, Dylan A.
A2 - Toussaint, Marc
A2 - Hsieh, M. Ani
PB - MIT Press Journals
T2 - 17th Robotics: Science and Systems, RSS 2021
Y2 - 12 July 2021 through 16 July 2021
ER -