The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The minimum time optimal control problem for a signalized intersection is defined as finding the green split that dissolves all initial non-zero queue lengths in minimum time. Here, the optimal minimum time control for an isolated intersection is found in explicit state feedback form, where the state is defined as the queue lengths, by the use of a clever modification of D. Gazis's continuous differential...
In sparse mobile social networks, the moving activity of nodes always happen in a specific area, which corresponds to some specific community. How to guarantee the higher packet delivery ratio while reducing forwarding delay in such networks, is a challenging issue and has not been widely investigated yet. Recently, additional super-node was introduced to ferry packets between the isolated areas....
An equation-error (EE) method is described for estimating the three motion parameters of a watercraft (sound source) moving on the sea surface at a constant speed in a constant direction as it transits past a hydrophone located above the sea floor in a shallow water environment, using multipath delay measurements from the hydrophone. The motion parameter estimates are obtained via a linear least-squares...
In this paper robust constrained regulation problem for a discrete-time system with actuation delay has been considered. Persistent but bounded measurement noise and disturbance input are present. Furthermore, a polytopic bound on estimation error is assumed to be given. A linear estimator is designed such that the given polytopic estimation error bound is achievable. Actuating delay is compensated...
This paper gives sufficient conditions for the practical and finite time stability of a particular class of linear discrete time delay systems. Analyzing the finite time stability concept, these new delay-independent conditions are derived using an approach based on the Lyapunov-like functions. The practical stability and attractive practical stability for discrete time delay systems have been investigated...
A human-in-the-loop simulation of an integrated set of time-based automation tools that provided precision scheduling, sequencing and ground-based merging and spacing functions was run in the fall of 2010. These functions were combined into the Terminal Area Precision Scheduling and Spacing (TAPSS) system. TAPSS consists of a scheduler and two suites of advisory tools, one for the Air Route Traffic...
Proximity sensors are increasingly used in distributed monitoring applications, e.g. for surveillance purposes. However, most of existing solutions have two different, usually contrasting requirements, i.e. either they have strong directional features, or they just cover very short distances. In order to tackle such issues, in this paper a new, almost omnidirectional proximity detection technique...
We study the rendezvous data collection problem for the mobile sink in wireless sensor networks. We introduce to jointly optimize trajectory planning for the mobile sink and workload balancing for the network. By doing so, the mobile sink is able to efficiently collect network-wide data within a given delay bound and the network can eliminate the energy bottleneck to dramatically prolong its lifetime...
Multiple robots can be teleoperated by a single operator to provide enhanced capacity and efficiency on accomplishing complicated tasks. The design of this kind of systems is challenging because simultaneously tele-controlling multiple robots exceeds the ability of one single operator. The intelligence and autonomy of the robots need to be integrated into the system. Besides, the communication between...
Advances in autonomous vehicles and intelligent transportation systems indicate a rapidly approaching future in which intelligent vehicles will automatically handle the process of driving. However, increasing the efficiency of today's transportation infrastructure will require intelligent traffic control mechanisms that work hand in hand with intelligent vehicles. To this end, Dresner and Stone proposed...
Motion planning for multiple robots is tractable in case we can assume a roadmap on which all the robots travel, which is often the case in many automated guided vehicle domains, such as factory floors or container terminals. We present an O(nv log(nv) + n2v) (n the number of nodes, v the number of vehicles) route planning algorithm for a single robot, which can find the minimum-time route given a...
This paper presents the new result in the Trajectory approach when considering more than one packet of a sporadic flow is overstocked on an output port for an AFDX network, using the FIFO assumption. The principal contribution is to compute upper bounds of end-to-end delays for the processing flows by the recursive calculation of interference time windows. The paper proposes a memo recursive computation...
The article provides sufficient conditions for both practical and finite time stability of linear continuous time delay systems described as X(t) = A0X(t) + A1X(t − τ). Considering a finite time stability concept, the new delay independent conditions have been derived using the approach based on the Lyapunov-like functions. These functions do not need to have the properties of positivity in the whole...
In this paper, we propose enhanced Simple Forwarding over Trajectory (eSIFT), a novel opportunistic trajectory-based routing protocol for Vehicular Ad hoc Networks (VANETs), based on Simple Forwarding over Trajectory (SIFT). eSIFT is designed to operate in highly dynamic vehicular networks for data dissemination. eSIFT presents advantages such as no discovery step and low overhead. We also present...
We investigate a system of mutually coupled three neurons in a line with the inhibitory synapses as a basic motif of complex networks. For class I and class II neurons, bifurcation structure is analyzed when we change the external DC current of a middle neuron. In both classes, the neurons have a wide parameter region in which stable 1∶2 cluster synchronous firing is observed as the external DC current...
Multi-robot formation control with communication constraints has been attracting more and more attentions because of its wide applications in many areas. The existing methods usually need to put some assumptions on the communication constraints, such as delay bounds. These assumptions cannot be always satisfied in real communication networks like the Internet. This paper proposes a non-time based...
Hyperchaos sequences have been widely used as a kind of complex pseudorandom sequences. But some well known Hyperchaos sequences, such as CML sequence, have poor autocorrelation performance, and their applications are limited. Based on recently presented APAS theorem, we modified CML map to S-CML map, and S-CML sequence has excellent autocorrelation performance, whereas its other performances are...
This paper investigates the global exact consensus problem of networked Multi-Agent Systems (MAS) consisting of nonlinear, identical agent dynamics and communication time-delay topology. We derive global exact consensus conditions by using of linear feedback and apaptive feedback respectively, and the proposed results are theoretically proved to be effective based on the Lyapunov-Krasovskii functional...
The sliding mode control problem of a class of uncertain neutral delay systems is considered. By selecting a sliding surface depending on the current state and delayed state, the paper gives delay-independent sufficient condition and delay-dependent sufficient condition in terms of linear matrix inequalities(LMIs) such that the closed-loop system is guaranteed to be asymptotically stable. According...
This paper studies consensus problem of discrete-time networked multi-agent systems (NMASs) with directed networks and a communication delay. A novel consensus protocol based on the networked predictive control schemes is proposed to compensate for communication delay actively. For the NMAS with fixed directed topology and a constant delay, necessary and sufficient conditions of achieving consensus...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.