@inproceedings{9341312,
  author = {Zhao, Luyang and Putman, Josiah and Wang, Weifu and Balkcom, Devin},
  booktitle = {IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)},
  title = {PLRC*: A piecewise linear regression complex for approximating optimal robot motion},
  year = {2020},
  volume = {},
  number = {},
  pages = {6681-6688},
  doi = {10.1109/IROS45743.2020.9341312},
  link = {https://ieeexplore.ieee.org/abstract/document/9341312},
  pdf = {papers/plrc.pdf},
  abstract = {Discrete graphs are commonly used to approximately represent configuration spaces used in robot motion planning. This paper explores a representation in which the costs of crossing local regions of the configuration space are represented using piecewise linear regression (PLR). We explore a few simple motion planning problems, and show that for these problems, the memory required to store the representation compares favorably to that required for standard discrete vertex-and-edge models, while preserving the quality of paths returned from searches.},
  abbr = {plrc}
}
