Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound

Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound

SM thesis

Bibliographic Details
Main Author:	Effinger, Robert
Other Authors:	Brian Williams
Published:	2018
Online Access:	http://hdl.handle.net/1721.1/113365

Similar Items

Optimal temporal planning at reactive time scales via dynamic backtracking branch and bound
by: Effinger, Robert T
Published: (2007)

Dynamic Controllability of Temporally-flexible Reactive Programs
by: Effinger, Robert Temple, et al.
Published: (2011)

Backtracking and Mixing Rate of Diffusion on Uncorrelated Temporal Networks
by: Gueuning, M, et al.
Published: (2017)

Risk-Bounded Dynamic Scheduling of Temporal Plans
by: Wang, Andrew J.
Published: (2023)

Backtracking Counterfactuals Revisited
by: Khoo, Justin Donald
Published: (2018)

Sparse regression at scale: branch-and-bound rooted in first-order optimization
by: Hazimeh, Hussein, et al.
Published: (2022)

Dynamic execution of temporal plans with sensing actions and bounded risk
by: Rodrigues Quemel e Assis Santana, Pedro Henrique de
Published: (2017)

Efficient Monadic−style Backtracking
by: Hinze, R
Published: (1996)

Deriving backtracking monad transformers
by: Hinze, R
Published: (2000)

A Multipurpose backtracking algorithm
by: Priestley, H, et al.
Published: (1994)

Branch-and-bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009)

Branch-and bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009)

Packet parsing : a practical linear-time algorithm with backtracking
by: Ford, Bryan, 1973-
Published: (2014)

Backtracking with cut via a distributive law and left-zero monoids
by: Piróg, M, et al.
Published: (2017)

Measuring Backtracking on Delivery Routes through Community Detection
by: Noszek, Joseph Robert
Published: (2022)

A Backtracking Particle Filter for Fusing Building Plans with PDR Displacement Estimates
by: Widyawan, Widyawan
Published: (2008)

Optimization of fed-batch fermentation processes using the Backtracking Search Algorithm
by: Mohd Zain, Mohamad Zihin, et al.
Published: (2018)

Backtracking Games and Inflationary Fixed Points
by: Dawar, A, et al.
Published: (2006)

Experimenting an approach for the design of backtracking in software
by: Yau, Kin Hung.
Published: (2009)

Backtracking games and inflationary fixed points
by: Dawar, A, et al.
Published: (2004)

Solution of capital investment problems via branch and bounds method
by: Zainodin Haji Jubok,
Published: (1996)

On the exponential generating function for non-backtracking walks
by: Arrigo, F, et al.
Published: (2018)

Dependency-Directed Backtracking in Non-Deterministic Scheme
by: Zabih, Ramin
Published: (2009)

Non-backtracking walk centrality for directed networks
by: Arrigo, F, et al.
Published: (2017)

Experimenting a metric suite for backtracking design
by: Shaw, Wen Yeak.
Published: (2011)

Backtracking to the future: unraveling the origins of childhood leukemia
by: de Smith, AJ, et al.
Published: (2023)

Optimal DG Placement and Sizing for Voltage Stability Improvement Using Backtracking Search Algorithm
by: Ruhaizad, Ishak, et al.
Published: (2014)

Short-Term Electricity Price Forecasting via Hybrid Backtracking Search Algorithm and ANFIS Approach
by: Pourdaryaei, Alireza, et al.
Published: (2019)

Time-bounded large-scale mission planning under uncertainty for UV disinfection
by: Brudermüller, L, et al.
Published: (2022)

Reactive Task and Motion Planning under Temporal Logic Specifications
by: Li, Shen, et al.
Published: (2022)

MIC: Dr Ms backtracking no surprise any more
by: News Straits, Times
Published: (2017)

MIC: Dr Ms backtracking no surprise any more
by: News Straits, Times
Published: (2017)

MIC: Dr Ms backtracking no surprise any more
by: News Straits, Times
Published: (2017)

MIC: Dr Ms backtracking no surprise any more
by: News Straits, Times (Sabah)
Published: (2017)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
by: Gottlob, G, et al.
Published: (2007)

Bounded Width Branching Programs
by: Barrington, David A.
Published: (2023)

Difficulty-aware time-bounded planning under uncertainty for large-scale robot missions
by: Staniaszek, M, et al.
Published: (2023)

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
by: Cartis, C, et al.
Published: (2015)

Divisible quantum dynamics satisfies temporal Tsirelson’s bound
by: Le, Thao, et al.
Published: (2017)

Optimal planning with temporal logic specifications
by: Karaman, Sertac
Published: (2010)