Larsson, Daniel T., Maity, Dipankar, and Tsiotras, Panagiotis. Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations. Retrieved from https://par.nsf.gov/biblio/10213619. IEEE Transactions on Robotics 36.6 Web. doi:10.1109/TRO.2020.3003219.

Larsson, Daniel T., Maity, Dipankar, & Tsiotras, Panagiotis. Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations. IEEE Transactions on Robotics, 36 (6). Retrieved from https://par.nsf.gov/biblio/10213619. https://doi.org/10.1109/TRO.2020.3003219

Larsson, Daniel T., Maity, Dipankar, and Tsiotras, Panagiotis. "Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations". IEEE Transactions on Robotics 36 (6). Country unknown/Code not available. https://doi.org/10.1109/TRO.2020.3003219. https://par.nsf.gov/biblio/10213619.

@article{osti_10213619,
place = {Country unknown/Code not available}, title = {Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations}, url = {https://par.nsf.gov/biblio/10213619}, DOI = {10.1109/TRO.2020.3003219}, abstractNote = {}, journal = {IEEE Transactions on Robotics}, volume = {36}, number = {6}, author = {Larsson, Daniel T. and Maity, Dipankar and Tsiotras, Panagiotis}, editor = {null} }