Skip to content

An agent-based navigation system inspired by Marcus Clements' research on empowerment and relevant goal information. The project simulates random walks and shortest paths in graphs, calculating metrics like degree, closeness, and betweenness centrality to explore decision-making in graph environments.

Notifications You must be signed in to change notification settings

phmarcel0x/empowered-graph-navigator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Agent-Based Navigation in Graphs

This project implements agent-based navigation using graph-theoretic and information-theoretic measures. Inspired by Marcus Clements' research on navigation in urban environments, the agent simulates decision-making in graph networks through two methods:

  • Random Walks
  • Shortest Pathfinding

The agent tracks visited nodes and performs simulations to compare movement strategies. The project also implements core graph metrics:

  • Degree Centrality
  • Closeness Centrality
  • Betweenness Centrality

Features

  • Agent Simulation: Navigate graphs using random walks and shortest paths.
  • Graph Metrics: Calculate centrality measures to evaluate node importance.
  • Memory Tracking: Record visited nodes to compare strategies.
  • Simulation Results: Compare random walk and shortest path strategies over 1000 simulations.

Research Paper

This work is based on:

Empowerment and Relevant Goal Information as Alternatives to Graph-Theoretic Centrality for Navigational Decision Making by Marcus Clements.

The paper explores the correlation between graph centrality and human navigation using empowerment and goal information measures.

Implemented Graph

Empowerment Graph
Figure 1: The Implemented Graph

Centrality Measures

Degree Centrality Closeness Centrality Betweenness Centrality
Figure 2: Centrality Measures

Have a great day :)

About

An agent-based navigation system inspired by Marcus Clements' research on empowerment and relevant goal information. The project simulates random walks and shortest paths in graphs, calculating metrics like degree, closeness, and betweenness centrality to explore decision-making in graph environments.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages