A HEURISTIC EVOLUTIONARY ALGORITHM FOR PLANNING MOVING AGENTS ACCORDING TO THE EQUILIBRIUM INSTEAD OF MULTI-OBJECTIVE OPTIMIZATION

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

VAHIDNIA M.H.; ALESHEIKH A.A.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY Year:2014 | Volume:4 | Issue:1 Page(s): 107-118

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

578

Download:

Cites:

Information Journal Paper

Title

A HEURISTIC EVOLUTIONARY ALGORITHM FOR PLANNING MOVING AGENTS ACCORDING TO THE EQUILIBRIUM INSTEAD OF MULTI-OBJECTIVE OPTIMIZATION

Author(s)

VAHIDNIA M.H. | ALESHEIKH A.A. | Issue Writer Certificate

Keywords

GEOSPATIAL INFORMATION SYSTEMQ1

MOVING AGENTSQ2

GAME THEORYQ1

NASH EQUILIBRIUMQ2

HEURISTIC EVOLUTIONARY ALGORITHMQ2

Abstract

Agent-based methodologies facilitate complicated hypotheses verification, modeling and dynamic simulation. Hence, there are many interests in the geospatial information science to model rational autonomous agents due to their closer-to-realism decision-making and influence on environment. In this study, we consider the planning and task distribution among vehicle entities in the geospatial domains based on an agent-based approach. We show at the beginning of the paper, the rational agents have tendency to change their strategies to reach the highest possible satisfaction/utility. To obtain such a utility in the group of collaborative agents, equilibrium, a key concept taken from the GAME THEORY, appears more efficient than the common multi-objective optimization. We challenge this issue according to the dependency or contention of MOVING AGENTS'' payoffs. Because of high complexity of determining equilibrium, i.e. exponential, an efficient non-deterministic heuristic algorithm is proposed. We get our inspiration from evolutionary computations to introduce this novel algorithm. We have evaluated our approach with several datasets and received perfectly acceptable convergence, accuracy and speed. In comparison to a pure deterministic method, retrieving the equilibrium and the optimality of the best equilibrium solution were experimented at least as 80% and 92% respectively.

Cites

No record.

References

No record.

Cite

APA: Copy

VAHIDNIA, M.H., & ALESHEIKH, A.A.. (2014). A HEURISTIC EVOLUTIONARY ALGORITHM FOR PLANNING MOVING AGENTS ACCORDING TO THE EQUILIBRIUM INSTEAD OF MULTI-OBJECTIVE OPTIMIZATION. JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY, 4(1), 107-118. SID. https://sid.ir/paper/249387/en

Vancouver: Copy

VAHIDNIA M.H., ALESHEIKH A.A.. A HEURISTIC EVOLUTIONARY ALGORITHM FOR PLANNING MOVING AGENTS ACCORDING TO THE EQUILIBRIUM INSTEAD OF MULTI-OBJECTIVE OPTIMIZATION. JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY[Internet]. 2014;4(1):107-118. Available from: https://sid.ir/paper/249387/en

IEEE: Copy

M.H. VAHIDNIA, and A.A. ALESHEIKH, “A HEURISTIC EVOLUTIONARY ALGORITHM FOR PLANNING MOVING AGENTS ACCORDING TO THE EQUILIBRIUM INSTEAD OF MULTI-OBJECTIVE OPTIMIZATION,” JOURNAL OF GEOMATICS SCIENCE AND TECHNOLOGY, vol. 4, no. 1, pp. 107–118, 2014, [Online]. Available: https://sid.ir/paper/249387/en

Related Journal Papers