9,711 research outputs found
Recommended from our members
An agent-based DDM for high level architecture
The Data Distribution Management (DDM) service is one of the six services provided in the Runtime Infrastructure (RTI) of High Level Architecture (HLA). Its purpose is to perform data filtering and reduce irrelevant data communicated between federates. The two DDM schemes proposed for RTI, region based and grid based DDM, are oriented to send as little irrelevant data to subscribers as possible, but only manage to filter part of this information and some irrelevant data is still being communicated. Previously (G. Tan et al., 2000), we employed intelligent agents to perform data filtering in HLA, implemented an agent based DDM in RTI (ARTI) and compared it with the other two filtering mechanisms. The paper reports on additional experiments, results and analysis using two scenarios: the AWACS sensing aircraft simulation and the air traffic control simulation scenario. Experimental results show that compared with other mechanisms, the agent based approach communicates only relevant data and minimizes network communication, and is also comparable in terms of time efficiency. Some guidelines on when the agent based scheme can be used are also give
CBPRS: A City Based Parking and Routing System
Navigational systems assist drivers in finding a route between two locations that is time optimal in theory but seldom in practice due to delaying circumstances the system is unaware of, such as traffic jams. Upon arrival at the destination the service of the system ends and the driver is forced to locate a parking place without further assistance. We propose a City Based Parking Routing System (CBPRS) that monitors and reserves parking places for CBPRS participants within a city. The CBPRS guides vehicles using an ant based distributed hierarchical routing algorithm to their reserved parking place. Through means of experiments in a simulation environment we found that reductions of travel times for participants were significant in comparison to a situation where vehicles relied on static routing information generated by the well known Dijkstra’s algorithm. Furthermore, we found that the CBPRS was able to increase city wide traffic flows and decrease the number and duration of traffic jams throughout the city once the number of participants increased.information systems;computer simulation;dynamic routing
Adaptive routing in active networks
New conceptual ideas on network architectures have been proposed in the recent past. Current store-andforward
routers are replaced by active intermediate systems,
which are able to perform computations on transient packets,
in a way that results very helpful for developing and
deploying new protocols in a short time. This paper introduces a new routing algorithm, based on a congestion
metric, and inspired by the behavior of ants in nature. The
use of the Active Networks paradigm associated with a cooperative learning environment produces a robust, decentralized algorithm capable of adapting quickly to changing conditions
QoS routing in ad-hoc networks using GA and multi-objective optimization
Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version
Interaction between intelligent agent strategies for real-time transportation planning
In this paper we study the real-time scheduling of time-sensitive full truckload pickup-and-delivery jobs. The problem involves the allocation of jobs to a fixed set of vehicles which might belong to dfferent collaborating transportation agencies. A recently proposed solution methodology for this problem is the use of a multi-agent system where shipper agents other jobs through sequential auctions and vehicle agents bid on these jobs. In this paper we consider such a multi-agent system where both the vehicle agents and the shipper agents are using profit maximizing look-ahead strategies. Our main contribution is that we study the interrelation of these strategies and their impact on the system-wide logistical costs. From our simulation results, we conclude that the system-wide logistical costs (i) are always reduced by using the look-ahead policies instead of a myopic policy (10-20%) and (ii) the joint effect of two look-ahead policies is larger than the effect of an individual policy. To provide an indication of the savings that might be realized with a central solution methodology, we benchmark our results against an integer programming approach
Recommended from our members
Extending TRANSIMS Technology to an Integrated Multilevel Representation
The TRANSIMS system developed at Los Alamos in the USA over the past decade is a world leader in providing an integrated land-use transportation dynamical model for large areas with a million or more inhabitants. TRANSIMS uses standard survey data to create synthetic micropopulations, including family structure, to simulate trip making and emergent traffic dynamics. We propose to extend TRANSIMS by adapting it to a new multi-level representation, allowing dynamics to be algebraically integrated at the micro-, meso- and macro-levels. The new representation builds a lattice hierarchy in a way that integrates non-partitional hierarchies of links and routes based on the usual hierarchy of geographical zones, e.g. neighbourhoods, districts, cities, counties and countries. Applying the representation to a big city starts by defining sets of zones at different levels. At the first level, N, is the street. This can be subdivided to building plots at level N-1, buildings at level N-2, and even rooms at level N-3. At level N+1 are the neighbourhoods, at level N+2 is the set of district zones (each of them containing the different neighbourhoods in the previous level), and at the top level N+3 (in this case), is just one zone, the city itself. If a larger study area is to be considered, we would have a whole set of N+3 zones defining N+4-level areas, and so on, extending to the level of counties, countries or even continents. This paper will explain the fundamentals of TRANSIMS technology and compare it to other systems. We will show how TRANSIMS and the new multi-level representation can be brought together to give new insights into the macro-dynamics of very large road systems such as London, England and even the whole of Europe
- …