Fetching the paper…
Reading the bibliography…
Safe and successful deployment of robots requires not only the ability to generate complex plans but also the capacity to frequently replan and correct execution errors.
V. Mnih, A. P. Badia, M. Mirza, A. Graves, T. Lillicrap, T. Harley, D. Silver, and K. Kavukcuoglu, “Asynchronous methods for deep reinforcement learning,” in Int. Conf. Mach. Learn. , ser. Proceedings of Machine Learning Research, M. F. Balcan and K. Q. Weinberger, Eds., vol. 48. New York, New York, USA: PMLR, 20–22 Jun 2016, pp. 1928–1937
1937
Earlier work this paper cites.
A. Pnueli, “The temporal logic of programs,” in 18th Annu. Symp. Found. Comput. Sci. , 1977, pp. 46–57
1977
Earlier work this paper cites.
M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1st ed. USA: John Wiley & Sons, Inc., 1994
1994
Earlier work this paper cites.
R. S. Sutton, D. Precup, and S. Singh, “Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning,” Artificial Intelligence , vol. 112, no. 1, pp. 181–211, 1999
1999
Earlier work this paper cites.
F. Bacchus and F. Kabanza, “Using temporal logics to express search control knowledge for planning,” Artif. Intell. , vol. 116, no. 1, pp. 123–191, 2000
2000
Earlier work this paper cites.
O. Kupferman and M. Y. Vardi, “Model checking of safety properties,” Formal methods in system design , vol. 19, pp. 291–314, 2001
2001
Earlier work this paper cites.
M. Gori, G. Monfardini, and F. Scarselli, “A new model for learning in graph domains,” in Proc. IEEE Int. Joint Conf. Neural Netw. , vol. 2, 2005, pp. 729–734
2005
Earlier work this paper cites.
J. A. Baier and S. A. McIlraith, “Planning with temporally extended goals using heuristic search,” in Proc. Int. Conf. Automated Planning and Scheduling , 2006, p. 342–345
2006
Earlier work this paper cites.
C. Baier and J. Katoen, Principles of Model Checking . MIT Press, 2008
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Trans. Neural Networks , vol. 20, no. 1, pp. 61–80, 2009
2009
Earlier work this paper cites.
T. Wongpiromsarn, U. Topcu, and R. M. Murray, “Receding horizon temporal logic planning for dynamical systems,” in Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference , 2009, pp. 5997–6004
2009
Earlier work this paper cites.
H. Hasselt, “Double q-learning,” in Advances in Neural Inf. Process. Syst. , J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, Eds., vol. 23. Curran Associates, Inc., 2010
2010
Earlier work this paper cites.
P. Vincent, “A connection between score matching and denoising autoencoders,” Neural Comput. , vol. 23, no. 7, pp. 1661–1674, 2011
2011
Earlier work this paper cites.
B. Efron, “Tweedie’s formula and selection bias,” J. Amer. Statistical Assoc. , vol. 106, no. 496, pp. 1602–1614, 2011
2011
Earlier work this paper cites.
A. Kulesza, B. Taskar, et al. , “Determinantal point processes for machine learning,” Foundations and Trends® in Machine Learning , vol. 5, no. 2–3, pp. 123–286, 2012
2012
Cited alongside, same era.
B. Lacerda, D. Parker, and N. Hawes, “Optimal and dynamic planning for markov decision processes with co-safe ltl specifications,” in 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems , 2014, pp. 1511–1516
2014
Cited alongside, same era.
——, “Optimal policy generation for partially satisfiable co-safe LTL specifications,” in Int. Joint Conf. Artif. Intell. , vol. 15, July 2015, pp. 1587–1593
2015
Cited alongside, same era.
C. Belta, B. Yordanov, and E. A. Gol, Formal Methods for Discrete-Time Dynamical Systems . Springer, 2017, vol. 89
2017
Cited alongside, same era.
A. Camacho, J. Baier, C. Muise, and S. McIlraith, “Finite LTL synthesis as planning,” in Proc. Int. Conf. Automated Planning and Scheduling , vol. 28, 2018, pp. 29–38
Y. Xie, F. Zhou, and H. Soh, “Embedding symbolic temporal knowledge into deep sequential models,” in IEEE Int. Conf. Robot. Automat. , 2021, pp. 4267–4273
2021
Later among the works it cites.
M. Janner, Y. Du, J. B. Tenenbaum, and S. Levine, “Planning with diffusion for flexible behavior synthesis,” in Int. Conf. Mach. Learn. , vol. 162, 2022, pp. 9902–9915
2022
Later among the works it cites.
C. Yang, M. L. Littman, and M. Carbin, “On the (in)tractability of reinforcement learning for LTL objectives,” in Int. Joint Conf. Artif. Intell. , 2022, pp. 3650–3658
2022
Later among the works it cites.
C. Voloshin, H. M. Le, S. Chaudhuri, and Y. Yue, “Policy optimization with linear temporal logic constraints,” in Advances in Neural Inf. Process. Syst. , 2022, pp. 17 690–17 702
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
R. S. Sutton and A. G. Barto, Reinforcement learning: An introduction . MIT press, 2018
2018
Cited alongside, same era.
R. Toro Icarte, T. Q. Klassen, R. Valenzano, and S. A. McIlraith, “Teaching multiple tasks to an RL agent using LTL,” in Proc. Int. Conf. Autonomous Agents Multiagent Syst. , 2018, pp. 452–461
2018
Cited alongside, same era.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in The Semantic Web , 2018, pp. 593–607
2018
Cited alongside, same era.
S. Fujimoto, H. van Hoof, and D. Meger, “Addressing function approximation error in actor-critic methods,” in Int. Conf. Mach. Learn. , ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. PMLR, 10–15 Jul 2018, pp. 1587–1596
2018
Cited alongside, same era.
R. Simmons-Edler, B. Eisner, E. Mitchell, S. Seung, and D. Lee, “Q-learning for continuous actions with cross-entropy guided policies,” 2019
2019
Cited alongside, same era.
J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” in Advances in Neural Inf. Process. Syst. , 2020, pp. 6840–6851
2020
Cited alongside, same era.
2020
Cited alongside, same era.
2022
Later among the works it cites.
W. Li, X. Wang, B. Jin, and H. Zha, “Hierarchical diffusion for offline decision making,” in Int. Conf. Mach. Learn. , ser. Proceedings of Machine Learning Research, A. Krause, E. Brunskill, K. Cho, B. Engelhardt, S. Sabato, and J. Scarlett, Eds., vol. 202. PMLR, 23–29 Jul 2023, pp. 20 035–20 064
2023
Later among the works it cites.
C. Chi, S. Feng, Y. Du, Z. Xu, E. Cousineau, B. Burchfiel, and S. Song, “Diffusion policy: Visuomotor policy learning via action diffusion,” in Proc. Robot.: Sci. and Syst. (RSS) , 2023
2023
Later among the works it cites.
H. Chung, J. Kim, M. T. Mccann, M. L. Klasky, and J. C. Ye, “Diffusion posterior sampling for general noisy inverse problems,” in Int. Conf. Learn. Representations , 2023
2023
Later among the works it cites.
J. Song, Q. Zhang, H. Yin, M. Mardani, M.-Y. Liu, J. Kautz, Y. Chen, and A. Vahdat, “Loss-guided diffusion models for plug-and-play controllable generation,” in Int. Conf. Mach. Learn. , vol. 202, 2023, pp. 32 483–32 498
2023
Later among the works it cites.
D. Tian, H. Fang, Q. Yang, H. Yu, W. Liang, and Y. Wu, “Reinforcement learning under temporal logic constraints as a sequence modeling problem,” Robotics and Autonomous Systems , vol. 161, p. 104351, 2023
2023
Later among the works it cites.
Z. Feng, H. Luan, P. Goyal, and H. Soh, “LTLDoG: Satisfying temporally-extended symbolic constraints for safe diffusion-based planning,” IEEE Robotics and Automation Letters , vol. 9, no. 10, pp. 8571–8578, 2024
2024
Closest in time.
X. Ma, S. Patidar, I. Haughton, and S. James, “Hierarchical diffusion policy for kinematics-aware multi-task robotic manipulation,” IEEE/CVF Conf. Comput. Vis. Pattern Recognit. , 2024
2024
Closest in time.
J. X. Liu, A. Shah, E. Rosen, M. Jia, G. Konidaris, and S. Tellex, “Skill transfer for temporal task specification,” in IEEE Int. Conf. Robot. Automat. , 2024, pp. 2535–2541
2024
Closest in time.
G. Fainekos, H. Kress-Gazit, and G. Pappas, “Temporal logic motion planning for mobile robots,” in IEEE Int. Conf. Robot. Automat. , 2005, pp. 2020–2025
2025
Closest in time.