Fetching the paper…
Reading the bibliography…
We present a method to generate a robot control strategy that maximizes the probability to accomplish a task.
E. A. Emerson, “Temporal and modal logic,” in Handbook of Theoretical Computer Science: Formal Models and Semantics , J. van Leeuwen, Ed. Elsevier, 1990, vol. B, pp. 995–1072
1990
Earlier work this paper cites.
A. Dianco and L. D. Alfaro, “Model checking of probabilistic and nondeterministic systems,” in Foundations of Software Technology and Theoretical Computer Science , ser. Lecture Notes in Computer Science. Springer, 1995, vol. 1026, pp. 499–513
1995
Earlier work this paper cites.
C. Courcoubetis and M. Yannakakis, “Markov decision processes and regular events,” IEEE Transactions on Automatic Control , vol. 43, no. 10, pp. 1399–1418, 1998
1998
Earlier work this paper cites.
E. M. Clarke, D. Peled, and O. Grumberg, Model checking . MIT Press, 1999
1999
Earlier work this paper cites.
M. Vardi, “Probabilistic linear-time model checking: An overview of the automata-theoretic approach,” Formal Methods for Real-Time and Probabilistic Systems , pp. 265–276, 1999
1999
Earlier work this paper cites.
R. Alur, T. A. Henzinger, G. Lafferriere, and G. J. Pappas, “Discrete abstractions of hybrid systems,” Proceedings of the IEEE , vol. 88, pp. 971–984, 2000
2000
Earlier work this paper cites.
N. L. Zhang and W. Zhang, “Speeding up the convergence of value iteration in partially observable Markov decision processes,” Journal of Artificial Intelligence Research , vol. 14, pp. 29–51, 2001
2001
Earlier work this paper cites.
W. Thomas, “Infinite games and verification,” in Computer Aided Verification , ser. Lecture Notes in Computer Science, E. Brinksma and K. Larsen, Eds. Springer, 2002, vol. 2404, pp. 58–65
2002
Earlier work this paper cites.
J. Pineau and S. Thrun, “High-level robot behavior control using POMDPs,” in AAAI Workshop notes , Menlo Park, CA, 2002
2002
Earlier work this paper cites.
E. Gradel, W. Thomas, and T. Wilke, Automata, logics, and infinite games: A guide to current research , ser. Lecture Notes in Computer Science. Springer, 2002, vol. 2500
2002
Cited alongside, same era.
G. J. Pappas, “Bisimilar linear systems,” Automatica , vol. 39, no. 12, pp. 2035–2047, 2003
2003
Cited alongside, same era.
S. G. Loizou and K. J. Kyriakopoulos, “Automatic synthesis of multiagent motion tasks based on LTL specifications,” in IEEE Conf. on Decision and Control , Paradise Island, Bahamas, 2004, pp. 153–158
2004
Cited alongside, same era.
M. M. Quottrup, T. Bak, and R. Izadi-Zamanabadi, “Multi-robot motion planning: A timed automata approach,” in IEEE Int. Conf. on Robotics and Automation , New Orleans, LA, Apr. 2004, pp. 4417–4422
2004
Cited alongside, same era.
J. Klein and C. Baier, “Experiments with deterministic ω \omega -automata for formulas of linear temporal logic,” Theoretical Computer Science , vol. 363, no. 2, pp. 182–195, 2006
2006
Later among the works it cites.
H. Kress-Gazit, G. Fainekos, and G. J. Pappas, “Where’s Waldo? Sensor-based temporal logic motion planning,” in IEEE Int. Conf. on Robotics and Automation , Rome, Italy, 2007, pp. 3116–3121
2007
Later among the works it cites.
J. Klein, “ltl2dstar - LTL to deterministic Streett and Rabin automata,” http://www.ltl2dstar.de/ , 2007
2007
Later among the works it cites.
M. Kloetzer and C. Belta, “A fully automated framework for control of linear systems from temporal logic specifications,” IEEE Transactions on Automatic Control , vol. 53, no. 1, pp. 287–297, 2008
2008
Later among the works it cites.
C. Baier and J.-P. Katoen, Principles of Model Checking . MIT Press, 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
C. Baier, M. Größer, M. Leucker, B. Bollig, and F. Ciesinski, “Controller synthesis for probabilistic systems,” in Proceedings of IFIP TCS , 2004
2004
Cited alongside, same era.
L. Habets and J. van Schuppen, “A control problem for affine dynamical systems on a full-dimensional polytope,” Automatica , vol. 40, no. 1, pp. 21–35, 2004
2004
Cited alongside, same era.
C. Belta, V. Isler, and G. J. Pappas, “Discrete abstractions for robot planning and control in polygonal environments,” IEEE Transactions on Robotics , vol. 21, no. 5, pp. 864–874, 2005
2005
Cited alongside, same era.
N. Piterman, A. Pnueli, and Y. Saar, “Synthesis of reactive(1) designs,” in International Conference on Verification, Model Checking, and Abstract Interpretation , Charleston, SC, 2006, pp. 364–380
2006
Cited alongside, same era.
2008
Later among the works it cites.
S. Karaman and E. Frazzoli, “Sampling-based motion planning with deterministic μ \mu -calculus specifications,” in IEEE Conf. on Decision and Control , Shanghai, China, 2009, pp. 2222 – 2229
2009
Later among the works it cites.
T. Wongpiromsarn, U. Topcu, and R. M. Murray, “Receding horizon temporal logic planning for dynamical systems,” in IEEE Conf. on Decision and Control , Shanghai, China, 2009, pp. 5997–6004
2009
Later among the works it cites.
M. Lahijanian, J. Wasniewski, S. B. Andersson, and C. Belta, “Motion planning and control from temporal logic specifications with probabilistic satisfaction guarantees,” in IEEE Int. Conf. on Robotics and Automation , Anchorage, AK, 2010, pp. 3227 – 3232
2010
Later among the works it cites.