{"type":"ScholarlyArticle","title":"Width-Based Algorithms for Common Problems in Control, Planning and Reinforcement Learning","authors":[{"name":"Nir Lipovetzky","slug":"nir-lipovetzky","given":"Nir","family":"Lipovetzky","affiliation":""}],"abstract":"Width-based algorithms search for solutions through a general definition of state novelty. These algorithms have been shown to result in state-of-the-art performance in classical planning, and have been successfully applied to model-based and model-free settings where the dynamics of the problem are given through simulation engines. Width-based algorithms performance is understood theoretically through the notion of planning width, providing polynomial guarantees on their runtime and memory consumption. To facilitate synergies across research communities, this paper summarizes the area of width-based planning, and surveys current and future research directions.","doi":"10.24963/ijcai.2021/702","url":"https://ijcai.org/proceedings/2021/702","pdf":"https://ijcai.org/proceedings/2021/0702.pdf","markdown":"https://ijcai.org/proceedings/2021/702.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/702","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Early Career","track":"Early Career","number":702,"pages":{"first":4956,"last":4960},"keywords":["Planning and Scheduling: General","Planning and Scheduling: Theoretical Foundations of Planning","Planning and Scheduling: Planning Algorithms","Planning and Scheduling: Applications of Planning"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}