Online Algorithms: A Study of Graph-Theoretic Concepts

Albers, Susanne

doi:10.1007/3-540-46784-x_2

Cited by 8 publications

(2 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, during an on-line exploration, the information about the graph can only be learned in the execution of the exploration algorithm. Based on the concept of on-line exploration, the most used algorithms are the Depth First Search (DFS) and the Breadth First Search (BFS) [15]. A variation of on-line exploration was introduced by Betke et al [16].…”

Section: Constrained Explorationmentioning

confidence: 99%

Data-Foraging-Oriented Reconnaissance Based on Bio-Inspired Indirect Communication for Aerial Vehicles

et al. 2017

View full text Add to dashboard Cite

Abstract:In recent years, aerial vehicles have allowed exploring scenarios with harsh conditions. These can conduct reconnaissance tasks in areas that change periodically and have a high spatial and temporal resolution. The objective of a reconnaissance task is to survey an area and retrieve strategic information. The aerial vehicles, however, have inherent constraints in terms of energy and transmission range due to their mobility. Despite these constraints, the Data Foraging problem requires the aerial vehicles to exchange information about profitable data sources. In Data Foraging, establishing a single path is not viable because of dynamic conditions of the environment. Thus, reconnaissance must be focused on periodically searching profitable environmental data sources, as some animals perform foraging. In this work, a data-foraging-oriented reconnaissance algorithm based on bio-inspired indirect communication for aerial vehicles is presented. The approach establishes several paths that overlap to identify valuable data sources. Inspired by the stigmergy principle, the aerial vehicles indirectly communicate through artificial pheromones. The aerial vehicles traverse the environment using a heuristic algorithm that uses the artificial pheromones as feedback. The solution is formally defined and mathematically evaluated. In addition, we show the viability of the algorithm by simulations which have been tested through various statistical hypothesis.

show abstract

Section: Constrained Explorationmentioning

confidence: 99%

Data-Foraging-Oriented Reconnaissance Based on Bio-Inspired Indirect Communication for Aerial Vehicles

et al. 2017

View full text Add to dashboard Cite

show abstract

“…On-line fashion can be found in many research areas such as data structuring, task scheduling or resource allocation [10], [11]. In a data-structuring problem, it is desired to access elements in a given data structure at lower cost, without knowing which element will have to be accessed in the future.…”

Section: Competitive Algorithm For On-line Task Schedulingmentioning

confidence: 99%

On the dynamic allocation of mobile agents by on-line task scheduling

Yang

You

et al. 2002

Proceedings 16th International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

This paper presents a new approach to the dynamic allocation of mobile agents by on-line task scheduling for high performance in Internet computing. In contrast to the existing approaches, which apply predefined task scheduling schemes to allocate computing resources, we introduce a new on-line competitive algorithm to achieve flexibility. A guided allocation scheme based on the system competitive ratio is developed to optimize the allocation of mobile agents. The proposed system combines push-based technology with an innovative on-line task-scheduling scheme to speed up system response time and minimize system overheads. The system analysis and simulation demonstrate the feasibility and effectiveness of our approach to mobile agent-based Internet computing.

show abstract

Agent‐based task representation and processing in pervasive computing environment

Liu¹,

Luo²,

Cao³

2009

Wireless Communications

View full text Add to dashboard Cite

It is an effective approach to adopt software agent in pervasive computing (Per‐Com) environment. Meanwhile, task execution is the key problem which is affected directly by task representation method in Per‐Com environment. The task of agent in Per‐Com environment is dynamic and changeful, so the task representation should be flexible and agent‐oriented. However, most of the existing task representation methods cannot present task relationship clearly and lack unified format, which leads to a drawback that the corresponding task processing efficiency is not satisfying. In this paper, firstly, an agent‐based Per‐Com architecture is presented in which the agent is endowed with certain role. Secondly, through analyzing task relationship, an agent role based task relationship tree (TRT) model and an XML‐based agent task representation method are proposed. Thirdly, based on TRT, an agent task decomposing and online multi‐agent scheduling algorithm are presented to solve time‐optimal problems. Meanwhile, a load balancing strategy based on probability is proposed to increase agent utilization. Finally, a prototype of an application on traffic monitoring is presented. The results of evaluation indicate that the architecture is feasible and the simulation tests of time performance indicate that the proposed TRT‐based task processing methods have a better performance than others. Copyright © 2009 John Wiley & Sons, Ltd.

show abstract

Online Algorithms: A Study of Graph-Theoretic Concepts

Cited by 8 publications

References 36 publications

Data-Foraging-Oriented Reconnaissance Based on Bio-Inspired Indirect Communication for Aerial Vehicles

Data-Foraging-Oriented Reconnaissance Based on Bio-Inspired Indirect Communication for Aerial Vehicles

On the dynamic allocation of mobile agents by on-line task scheduling

Agent‐based task representation and processing in pervasive computing environment

Contact Info

Product

Resources

About