Results 1 - 10
of
145
A MOBILE AGENT-BASED FRAMEWORK FOR FLEXIBLE CONTROL OF MULTI-ROBOTIC SYSTEMS
"... ABSTRACT Modern manufacturing systems are increasingly becoming highly dynamic due to rapid changes in market and government regulations, as well as the integration of emerging technologies. To address the challenges of uncertainty, a flexible platform is critically needed for developing a new gene ..."
Abstract
- Add to MetaCart
generation of manufacturing systems. This paper presents a mobile agent-based framework that supports dynamic deployment of control algorithms and operations in multi-robotic systems. The framework is based on a mobile agent system called Mobile-C. It uses Ch, an interpretive C/C++ environment, for robot
A Semidefinite Programming Framework for Controlling Multi–robot Systems in Dynamic Environments
"... Abstract — In this paper, a discrete–time, semidefinite programming (SDP) framework is synthesized for controlling mobile robot teams operating in dynamic environments. Given an initially feasible configuration, the proffered framework embeds formation shape control and guarantees inter–agent and ag ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract — In this paper, a discrete–time, semidefinite programming (SDP) framework is synthesized for controlling mobile robot teams operating in dynamic environments. Given an initially feasible configuration, the proffered framework embeds formation shape control and guarantees inter
MobileGrid: Capacity-aware Topology Control in
"... Since wireless mobile ad hoc networks are arbitrarily and dynamically deployed, the network performance may be affected by many unpredictable factors such as the total number of nodes, physical area of deployment, and transmission range on each node. Previous research results only focus on maximizin ..."
Abstract
- Add to MetaCart
fully distributed topology control algorithm that attempts to achieve the best possible network capacity, by maintaining optimal contention index via dynamically adjusting the transmission range on each of the nodes in the network.
A Location Aware Routing Framework for Mobile Ad hoc Networks
"... MANET’s have dynamic, random, multi-hop topologies consisting of relatively low bandwidth and limited battery power. Robust and efficient operations in MANET are incorporated by introducing routing functionality into participating mobile nodes. The existing unicast routing protocols suffer from many ..."
Abstract
- Add to MetaCart
MANET’s have dynamic, random, multi-hop topologies consisting of relatively low bandwidth and limited battery power. Robust and efficient operations in MANET are incorporated by introducing routing functionality into participating mobile nodes. The existing unicast routing protocols suffer from
Controlling connectivity of dynamic graphs,” in
- Proc. 44th IEEE Conference on Decision and Control and European Control Conference,
, 2005
"... Abstract Dynamic networks have recently emerged as an efficient way to model various forms of interaction within teams of mobile agents, such as sensing and communication. This article focuses on the use of graphs as models of wireless communications. In this context, graphs have been used widely i ..."
Abstract
-
Cited by 60 (5 self)
- Add to MetaCart
Abstract Dynamic networks have recently emerged as an efficient way to model various forms of interaction within teams of mobile agents, such as sensing and communication. This article focuses on the use of graphs as models of wireless communications. In this context, graphs have been used widely
MOBILITY AWARE ROUTING FOR THE AIRBORNE NETWORK BACKBONE
"... The Airborne Network (AN) will form an essential part of the Global Information Grid in the future, thus providing information and decision superiority to US armed forces. AN is an enabling technology for Network Centric Warfare. AN is different from the terrestrial mobile ad-hoc networks (MANETs) a ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
of the AN nodes to enhance performance. Our routing protocol has two components: (1) a Mobility Aware Routing Protocol (MARP), that routes traffic based on the knowledge of network topology with respect to time and makes preemptive decisions to minimize packet losses due to link failure and discover better routes
Maximum Lifetime Routing in Wireless Ad-hoc Networks
- in INFOCOM
, 2004
"... Routing problems in mobile ad-hoc networks (MANET) have been receiving increasing attention in the last few years. Most of the proposed routing protocols concentrate on finding and maintaining routes in the face of changing topology caused by mobility or other environmental changes. More recently, p ..."
Abstract
-
Cited by 97 (0 self)
- Add to MetaCart
, power-aware routing protocols and topology control algorithms have been developed to address the issue of limited energy reserve of the nodes in ad-hoc networks. In this paper we consider the routing problem in MANET with the goal of maximizing the life time of the network. We propose a distributed
Mobility pattern aware routing in mobile ad hoc networks
, 2003
"... A Mobile ad hoc network is a collection of wireless nodes, all of which may be mobile, that dynamically create a wireless network amongst them without using any infrastructure. Ad hoc wireless networks come into being solely by peer-to-peer interactions among their constituent mobile nodes, and it i ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
mobility pattern aware routing algorithm is shown to have several distinct advantages such as (a) A more precise view of the entire network topology as the nodes move (b) A more precise view of the location of the individual nodes (c) Ability to predict with reasonably accuracy the future locations
IEEE TRANSACTIONS ON ROBOTICS 1 Constrained Interaction and Coordination in Proximity-Limited Multi-Agent Systems
"... Abstract—In this paper, we consider the problem of controlling the interactions of a group of mobile agents, subject to a set of topological constraints. Assuming proximity-limited inter-agent communication, we leverage mobility, unlike prior work, to enable adjacent agents to interact discriminativ ..."
Abstract
- Add to MetaCart
and control potentials, and we examine the dynamical properties of the resulting hybrid systems. Simulation results demonstrate the correctness of our proposed methods and the ability of our framework to generate topology-aware coordinated behavior. Index Terms—Distributed robot systems, dynamic networks
ATLAS: Adaptive Topology- and Load-Aware Scheduling
"... Abstract—The largest strength of contention-based MAC pro-tocols is simultaneously the largest weakness of their sched-uled counterparts: the ability to adapt to changes in network conditions. For scheduling to be competitive in mobile wireless networks, continuous adaptation must be addressed. We p ..."
Abstract
- Add to MetaCart
that ATLAS converges to most network changes in less than 0.1s, with about 20 % relative error, scaling with network size. We further study ATLAS in more dynamic networks and show that it keeps up with topology changes, and load changes sufficient for TCP to sustain multi-hop flows, a struggle in IEEE 802
Results 1 - 10
of
145