NDLI: A probabilistic movement model for shortest path formation in virtual ant-like agents

Please wait, while we are loading the content...

Peepholes with no strings attached: using image processing as input in camera-phones

A probabilistic movement model for shortest path formation in virtual ant-like agents

Constraint-based conversion of fiction text to a time-based graphical representation

Utilizing fuzzy logic and neural networks for effective, preventative intrusion detection in a wireless environment

A model to assess the benefit value of knowledge management in an IT service provider environment

Simulating adversarial interactions between intruders and system administrators using OODA-RR

Assessment of a framework to compare software development methodologies

Supporting CS1 with a program beacon recognition tool

Design principles for a virtual multiprocessor

Evolving pushdown automata

Dynamic role allocation for small search engine clusters

Providing a holistic perspective to evaluating e-service quality in web-based systems: a multi-stakeholder approach

Agile software development: a contemporary philosophical perspective

A hybrid approach to automatic programming for the object-oriented programming paradigm

Identity and access management for the distribution of social grants in South Africa

A comparative study of two usability evaluation methods using a web-based e-learning application

An ontology-based, multi-modal platform for the inclusion of marginalized rural communities into the knowledge society

Modelling the factors that influence mobile phone adoption

Criteria used in selecting effective requirements elicitation procedures

Generic process model structures: towards a standard notation for abstract representations

SQL's revoke with a view on privacy

KernTune: self-tuning Linux kernel performance using support vector machines

Examining the influence of demographic factors on internet users' information privacy concerns

A probabilistic movement model for shortest path formation in virtual ant-like agents

Content Provider	ACM Digital Library
Author	Chibaya, Colin Bangay, Shaun
Abstract	We propose a probabilistic movement model for controlling ant-like agents foraging between two points. Such agents are all identical, simple, autonomous and can only communicate indirectly through the environment. These agents secrete two types of pheromone, one to mark trails towards the goal and another to mark trails back to the starting point. Three pheromone perception strategies are proposed (Strategy A, B and C). Agents that use strategy A perceive the desirability of a neighbouring location as the difference between levels of attractive and repulsive pheromone in that location. With strategy B, agents perceive the desirability of a location as the quotient of levels of attractive and repulsive pheromone. Agents using strategy C determine the product of the levels of attractive pheromone with the complement of levels of repulsive pheromone. We conduct experiments to confirm directionality as emergent property of trails formed by agents that use each strategy. In addition, we compare path formation speed and the quality of the formed path under changes in the environment. We also investigate each strategy's robustness in environments that contain obstacles. Finally, we investigate how adaptive each strategy is when obstacles are eventually removed from the scene and find that the best strategy of these three is strategy A. Such a strategy provides useful guidelines to researchers in further applications of swarm intelligence metaphors for complex problem solving.
Starting Page	9
Ending Page	18
Page Count	10
File Format	PDF
ISBN	9781595937759
DOI	10.1145/1292491.1292493
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-10-02
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Directionality Speed Emergent behaviour Quality Dissipation Search and return pheromone Recruitment
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The relationship between emergence of the shortest path and information value using ant-like agents

Ant Colony System: An Improved Approach for Robot Path Planning

Binary ant colony algorithm with Balanced search bias

Modified fast bandwidth-constrained shortest path algorithm for maco.

A New Pheromone Control Algorithm of Ant Colony Optimization

Pheromone Evaluation in Ant Colony Optimization (2000)

Path vs. destination: A case study of blind noise assessment using modified ant shortest path

A novel greedy adaptive ant colony algorithm for shortest path of irrigation groups

Percolation analyses in a swarm based algorithm for shortest-path finding

A probabilistic movement model for shortest path formation in virtual ant-like agents

Similar Documents

The relationship between emergence of the shortest path and information value using ant-like agents

Ant Colony System: An Improved Approach for Robot Path Planning

Binary ant colony algorithm with Balanced search bias

Modified fast bandwidth-constrained shortest path algorithm for maco.

A New Pheromone Control Algorithm of Ant Colony Optimization

Pheromone Evaluation in Ant Colony Optimization (2000)

Path vs. destination: A case study of blind noise assessment using modified ant shortest path

A novel greedy adaptive ant colony algorithm for shortest path of irrigation groups

Percolation analyses in a swarm based algorithm for shortest-path finding

A probabilistic movement model for shortest path formation in virtual ant-like agents