By Topic

Proposed Architecture for the Combinatorial Problems Resolution Based on BDI Agents in Ubiquitous Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cabrera G, G. ; Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile ; Rubio L, J.M.

The objective of global optimality versus the cost that this implies is an unresolved issue by researchers. Classical problems such as travel salesman problem (TSP) or vehicle routing problem (VRP) and it's derivatives, relate to combinatorial optimization problems that arise on an everyday basis for a group of people that would like to have the solution to such problems as soon as possible. Thus, the idea that such problems purely operational, would be solved by heuristics in devices makes sense, due to the interest of normal use for sellers or car's drivers. Within the framework of what we may call ubiquitous distributed computing, this paper proposes an BDI architecture that supports the resolution of problems in complex combinatorial mobile devices across heuristics or metaheuristics embedded in the devices themselves and working from a set of data from a central server using agents for coordination and collaboration.

Published in:

Computer Sciences and Convergence Information Technology, 2009. ICCIT '09. Fourth International Conference on

Date of Conference:

24-26 Nov. 2009