Relating Strong Spatial Cognition to Symbolic Problem Solving --- An Example

06/14/2016
by   Ulrich Furbach, et al.
0

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.

READ FULL TEXT

page 2

page 5

research
08/18/2020

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

The Minimum Eccentricity Shortest Path Problem consists in finding a sho...
research
04/12/2021

A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals

We implement four algorithms for solving linear Diophantine equations in...
research
12/14/2017

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the es...
research
11/07/2019

A Hierarchical Optimizer for Recommendation System Based on Shortest Path Algorithm

Top-k Nearest Geosocial Keyword (T-kNGK) query on geosocial network is d...
research
07/10/2020

Learning to plan with uncertain topological maps

We train an agent to navigate in 3D environments using a hierarchical st...
research
05/19/2022

Optimal routing algorithm for trips involving thousands of ev-charging stations using Kinetica-Graph

This paper discusses a graph based route solving algorithm to find the o...
research
06/24/2022

Symbolic-Regression Boosting

Modifying standard gradient boosting by replacing the embedded weak lear...

Please sign up or login with your details

Forgot password? Click here to reset