Efficient Incremental Replanning for Feasible and Infeasible Linear Temporal Logic Task Specifications in Dynamic Environments
An incremental replanning algorithm that efficiently finds optimal solutions for both feasible and infeasible Linear Temporal Logic task specifications in dynamically changing environments.
