Packing Graphs with ASP for Landscape Simulation
Abstract
This paper describes an application of Answer Set Programming (ASP) to crop allocation for generating realistic landscapes. The aim is to cover optimally a bare landscape, represented by its plot graph, with spatial patterns describing local arrangements of crops. This problem belongs to the hard class of graph packing problems and is modeled in the framework of ASP. The approach provides a compact solution to the basic problem and at the same time allows extensions such as a flexible integration of expert knowledge. Particular attention is paid to the treatment of symmetries, especially due to sub-graph isomorphism issues. Experiments were conducted on a database of simulated and real landscapes. Currently, the approach can process graphs of medium size, a size that enables studies on real agricultural practices. PDF
Cite
Text
Guyet et al. "Packing Graphs with ASP for Landscape Simulation." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Guyet et al. "Packing Graphs with ASP for Landscape Simulation." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/guyet2016ijcai-packing/)BibTeX
@inproceedings{guyet2016ijcai-packing,
title = {{Packing Graphs with ASP for Landscape Simulation}},
author = {Guyet, Thomas and Moinard, Yves and Nicolas, Jacques and Quiniou, René},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {575-581},
url = {https://mlanthology.org/ijcai/2016/guyet2016ijcai-packing/}
}