Relating Strong Spatial Cognition to Symbolic Problem Solving --- An Example
Ulrich Furbach, Florian Furbach, Christian Freksa

TL;DR
This paper compares a strong spatial cognition approach to a symbolic graph-based algorithm for shortest path finding, highlighting their similarities and the ease of understanding the spatial method.
Contribution
It introduces and analyzes a strong spatial cognition approach, demonstrating its simplicity and immediate applicability compared to traditional symbolic algorithms.
Findings
Both approaches have similar structure and complexity.
Spatial cognition method is easier to understand.
Spatial approach is immediately applicable for problem solving.
Abstract
In this note, we discuss and analyse a shortest path finding approach using strong spatial cognition. It is compared with a symbolic graph-based algorithm and it is shown that both approaches are similar with respect to structure and complexity. Nevertheless, the strong spatial cognition solution is easy to understand and even pops up immediately when one has to solve the problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Evolutionary Algorithms and Applications · Data Management and Algorithms
