Fetching the paper…
Reading the bibliography…
Deploying robots in real-world environments, such as households and manufacturing lines, requires generalization across novel task specifications without violating safety constraints.
A. Pnueli, “The temporal logic of programs,” in 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) . ieee, 1977, pp. 46–57
1977
Earlier work this paper cites.
L. G. Valiant, “The complexity of computing the permanent,” Theoretical computer science , vol. 8, no. 2, pp. 189–201, 1979
1979
Earlier work this paper cites.
Z. Manna and A. Pneuli, “A hierarchy of temporal properties,” in ACM symposium on Principles of distributed computing , 1990
1990
Earlier work this paper cites.
R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper, “Simple on-the-fly automatic verification of linear temporal logic,” in International Conference on Protocol Specification, Testing and Verification . Springer, 1995, pp. 3–18
1995
Earlier work this paper cites.
M. Y. Vardi, “An automata-theoretic approach to linear temporal logic,” Logics for concurrency , pp. 238–266, 1996
1996
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. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0004370299000521
1999
Earlier work this paper cites.
O. Kupferman and M. Y. Vardi, “Model checking of safety properties,” Formal methods in system design , vol. 19, no. 3, pp. 291–314, 2001
2001
Earlier work this paper cites.
G. D. Konidaris and A. G. Barto, “Building portable options: Skill transfer in reinforcement learning.” in IJCAI , vol. 7, 2007, pp. 895–900
2007
Earlier work this paper cites.
M. Taylor and P. Stone, “Transfer learning for reinforcement learning domains: A survey,” Journal of Machine Learning Research , vol. 10, no. Jul, pp. 1633–1685, 2009
2009
Earlier work this paper cites.
2013
Earlier work this paper cites.
2017
Earlier work this paper cites.
J. Andreas, D. Klein, and S. Levine, “Modular multitask reinforcement learning with policy sketches,” in International Conference on Machine Learning . PMLR, 2017, pp. 166–175
2017
Cited alongside, same era.
A. Meurer, C. P. Smith, M. Paprocki, O. Čertík, S. B. Kirpichev, M. Rocklin, A. Kumar, S. Ivanov, J. K. Moore, S. Singh, T. Rathnayake, S. Vig, B. E. Granger, R. P. Muller, F. Bonazzi, H. Gupta, S. Vats, F. Johansson, F. Pedregosa, M. J. Curry, A. R. Terrel, v. Roučka, A. Saboo, I. Fernando, S. Kulal, R. Cimrman, and A. Scopatz, “Sympy: symbolic computing in python,” PeerJ Computer Science , vol. 3, p. e103, Jan. 2017. [Online]. Available: https://doi.org/10.7717/peerj-cs.103
2017
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 Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS) , 2018, pp. 452–461
2018
Cited alongside, same era.
S. James, B. Rosman, and G. Konidaris, “Learning portable representations for high-level planning,” in International Conference on Machine Learning . PMLR, 2020, pp. 4682–4691
2020
Later among the works it cites.
K. Jothimurugan, S. Bansal, O. Bastani, and R. Alur, “Compositional reinforcement learning from logical specifications,” in Thirty-Fifth Conference on Neural Information Processing Systems , 2021
2021
Later among the works it cites.
B. Araki, X. Li, K. Vodrahalli, J. Decastro, M. Fry, and D. Rus, “The logical options framework,” in Proceedings of the 38th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, M. Meila and T. Zhang, Eds., vol. 139. PMLR, 18–24 Jul 2021, pp. 307–317. [Online]. Available: https://proceedings.mlr.press/v139/araki21a.html
2021
Later among the works it cites.
P. Vaezipoor, A. C. Li, R. A. T. Icarte, and S. A. Mcilraith, “LTL2action: Generalizing LTL instructions for multi-task RL,” in International Conference on Machine Learning . PMLR, 2021, pp. 10 497–10 508
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Shah, P. Kamath, J. A. Shah, and S. Li, “Bayesian inference of temporal task specifications from demonstrations,” Advances in Neural Information Processing Systems , vol. 31, 2018
2018
Cited alongside, same era.
R. T. Icarte, T. Klassen, R. Valenzano, and S. McIlraith, “Using reward machines for high-level task specification and decomposition in reinforcement learning,” in International Conference on Machine Learning . PMLR, 2018, pp. 2107–2116
2018
Cited alongside, same era.
R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction , 2nd ed. The MIT Press, 2018. [Online]. Available: http://incompleteideas.net/book/the-book-2nd.html
2018
Cited alongside, same era.
A. Camacho, R. T. Icarte, T. Q. Klassen, R. A. Valenzano, and S. A. McIlraith, “Ltl and beyond: Formal languages for reward function specification in reinforcement learning.” in IJCAI , vol. 19, 2019, pp. 6065–6073
2019
Cited alongside, same era.
Z. Xu and U. Topcu, “Transfer of temporal logic formulas in reinforcement learning,” in IJCAI: proceedings of the conference , vol. 28. NIH Public Access, 2019, p. 4010
2019
Cited alongside, same era.
A. Bagaria and G. Konidaris, “Option discovery using deep skill chaining,” in International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
R. Patel, E. Pavlick, and S. Tellex, “Grounding language to non-markovian tasks with no supervision of task specifications,” in Robotics: Science and Systems , 2020
2020
Cited alongside, same era.
Y.-L. Kuo, B. Katz, and A. Barbu, “Encoding formulas as deep networks: Reinforcement learning for zero-shot execution of ltl formulas,” in 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2020, pp. 5604–5610
2020
Cited alongside, same era.
Boston Dynamics, “Spot® - the agile mobile robot,” https://www.bostondynamics.com/products/spot
Cited in the paper.
2021
Later among the works it cites.
A. Bagaria, J. Senthil, M. Slivinski, and G. Konidaris, “Robustly learning composable options in deep reinforcement learning,” in Proceedings of the 30th International Joint Conference on Artificial Intelligence , 2021
2021
Later among the works it cites.
R. T. Icarte, T. Q. Klassen, R. Valenzano, and S. A. McIlraith, “Reward machines: Exploiting reward function structure in reinforcement learning,” Journal of Artificial Intelligence Research , vol. 73, pp. 173–208, 2022
2022
Closest in time.
B. G. León, M. Shanahan, and F. Belardinelli, “Systematic generalisation through task temporal logic and deep reinforcement learning,” Adaptive and Learning Agents Workshop at International Conference on Autonomous Agents and Multiagent Systems , 2022
2022
Closest in time.
B. G. Leon, M. Shanahan, and F. Belardinelli, “In a nutshell, the human asked for this: Latent goals for following temporal specifications,” in International Conference on Learning Representations (ICLR) , 2022
2022
Closest in time.
2022
Closest in time.
J. X. Liu, Z. Yang, I. Idrees, S. Liang, B. Schornstein, S. Tellex, and A. Shah, “Grounding complex natural language commands for temporal tasks in unseen environments,” in Conference on Robot Learning (CoRL) . PMLR, 2023, pp. 1084–1110
2023
Closest in time.
T. M. Moerland, J. Broekens, A. Plaat, C. M. Jonker, et al. , “Model-based reinforcement learning: A survey,” Foundations and Trends® in Machine Learning , vol. 16, no. 1, pp. 1–118, 2023
2023
Closest in time.