Strategies for three dimensional deployment of tethered satellites

Tethered satellites deployed from the Space Shuttle have been proposed for diverse applications. A funda- mental issue in the utilization of tethers is quick deployment and retrieval of the attached payload. Inordinate librations of the tether during deployment and retrieval is undesirable. The structural damping present in the system is too low to contain the librations. Rupp [1] proposed to control the tether reel located in the parent spacecraft to alter the tension in the tether, which in turn changes the stiffness and the damping of the system. Baker[2] applied the tension control law to a model which included out of plane motion. Modi et al.[3] proposed a control law that included nonlinear feedback of the out-of plane tether angular rate. More recently, nonlinear feedback control laws based on Liapunov functions have been proposed. Two control laws are derived in [4]. The first is based on partial decomposition of the equations of motion and utilization of a two dimensional control law developed in [5]. The other is based on a Liapunov function that takes into consideration out-of-plane motion. It is shown[4] that the control laws are effective when used in conjunction with out-of-plane thrusting. Fujii et al.,[6] used the mission function control approach to study the control law including aerodynamic drag effect explicitly into the control algorithm.

Structural Modes of Stabilization of Permissive Phosphorylation Sites in Protein Kinases: Distinct Strategies in Ser/Thr and Tyr Kinases

Protein kinases phosphorylate several cellular proteins providing control mechanisms for various signalling processes. Their activity is impeded in a number of ways and restored by alteration in their structural properties leading to a catalytically active state. Most protein kinases are subjected to positive and negative regulation by phosphorylation of Ser/Thr/Tyr residues at specific sites within and outside the catalytic core. The current review describes the analysis on 3D structures of protein kinases that revealed features distinct to active states of Ser/Thr and Tyr kinases. The nature and extent of interactions among well-conserved residues surrounding the permissive phosphorylation sites differ among the two classes of enzymes. The network of interactions of highly conserved Arg preceding the catalytic base that mediates stabilization of the activation segment exemplifies such diverse interactions in the two groups of kinases. The N-terminal and the C-terminal lobes of various groups of protein kinases further show variations in their extent of coupling as suggested from the extent of interactions between key functional residues in activation segment and the N-terminal αC-helix. We observe higher similarity in the conformations of ATP bound to active forms of protein kinases compared to ATP conformations in the inactive forms of kinases. The extent of structural variations accompanying phosphorylation of protein kinases is widely varied. The comparison of their crystal structures and the distinct features observed are hoped to aid in the understanding of mechanisms underlying the control of the catalytic activity of distinct subgroups of protein kinases.

Inducible nitric oxide synthase and control of intracellular bacterial pathogens

Inducible nitric oxide synthase (iNOS) has important functions in innate immunity and regulation of immune functions. Here, the role of iNOS in the pathogenesis of various intracellular bacterial infections is discussed. These pathogens have also evolved a broad array of strategies to repair damage by reactive nitrogen intermediates, and to suppress or inhibit functions of iNOS.

Control of Agent Swarms using Generalized Centroidal Cyclic Pursuit Laws

One of the major tasks in swarm intelligence is to design decentralized but homogenoeus strategies to enable controlling the behaviour of swarms of agents. It has been shown in the literature that the point of convergence and motion of a swarm of autonomous mobile agents can be controlled by using cyclic pursuit laws. In cyclic pursuit, there exists a predefined cyclic connection between agents and each agent pursues the next agent in the cycle. In this paper we generalize this idea to a case where an agent pursues a point which is the weighted average of the positions of the remaining agents. This point correspond to a particular pursuit sequence. Using this concept of centroidal cyclic pursuit, the behavior of the agents is analyzed such that, by suitably selecting the agents' gain, the rendezvous point of the agents can be controlled, directed linear motion of the agents can be achieved, and the trajectories of the agents can be changed by switching between the pursuit sequences keeping some of the behaviors of the agents invariant. Simulation experiments are given to support the analytical proofs.

Design issues and caching strategies for CD-ROM based multimedia storage

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.

Existing and emerging strategies for the synthesis of nanoscale heterostructures

Development of new multifunctional nanostructures relies on the ability to make new materials at the nanoscale with control over size, shape and composition. While this control is extremely important to tune several properties, an alternative strategy is to create active interfaces between two or more nanostructures to form nanoscale heterostructures. In these heterostructures, the interfaces play a key role in stabilizing and enhancing the efficiency of the individual components for various applications. In this article, we discuss synthesis methods of different types of nanoscale heterostructures and the role of interfaces in various applications. We present the current state-of-the-art in designing heterostructures and possible upcoming synthetic strategies with their advantages and disadvantages. We present how such heterostructures are highly efficient for catalytic, photovoltaic and nanoelectronic applications drawing several examples from our own studies and from the literature.

Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (t) (1/eta), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.

Performance of a class of multi-robot deploy and search strategies based on centroidal voronoi configurations

This article considers a class of deploy and search strategies for multi-robot systems and evaluates their performance. The application framework used is deployment of a system of autonomous mobile robots equipped with required sensors in a search space to gather information. The lack of information about the search space is modelled as an uncertainty density distribution. The agents are deployed to maximise single-step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for sequential deploy and search (SDS) and combined deploy and search (CDS) strategies. Completeness results are provided for both search strategies. The deployment strategy is analysed in the presence of constraints on robot speed and limit on sensor range for the convergence of trajectories with corresponding control laws responsible for the motion of robots. SDS and CDS strategies are compared with standard greedy and random search strategies on the basis of time taken to achieve reduction in the uncertainty density below a desired level. The simulation experiments reveal several important issues related to the dependence of the relative performances of the search strategies on parameters such as the number of robots, speed of robots and their sensor range limits.

Optimal incentive timing strategies for product marketing on social networks

We consider the problem of devising incentive strategies for viral marketing of a product. In particular, we assume that the seller can influence penetration of the product by offering two incentive programs: a) direct incentives to potential buyers (influence) and b) referral rewards for customers who influence potential buyers to make the purchase (exploit connections). The problem is to determine the optimal timing of these programs over a finite time horizon. In contrast to algorithmic perspective popular in the literature, we take a mean-field approach and formulate the problem as a continuous-time deterministic optimal control problem. We show that the optimal strategy for the seller has a simple structure and can take both forms, namely, influence-and-exploit and exploit-and-influence. We also show that in some cases it may optimal for the seller to deploy incentive programs mostly for low degree nodes. We support our theoretical results through numerical studies and provide practical insights by analyzing various scenarios.

Zero miss distance guidance using feedforward and periodic control

There have been attempts at obtaining robust guidance laws to ensure zero miss distance (ZMD) for interceptors with parametric uncertainties. All these laws require the plant to be of minimum phase type to enable the overall guidance loop transfer function to satisfy strict positive realness (SPR). The SPR property implies absolute stability of the closed loop system, and has been shown in the literature to lead to ZMD because it avoids saturation of lateral acceleration. In these works higher order interceptors are reduced to lower order equivalent models for which control laws are designed to ensure ZMD. However, it has also been shown that when the original system with right half plane (RHP) zeros is considered, the resulting miss distances, using such strategies, can be quite high. In this paper, an alternative approach using the circle criterion establishes the conditions for absolute stability of the guidance loop and relaxes the conservative nature of some earlier results arising from assumption of in�nite engagement time. Further, a feedforward scheme in conjunction with a lead-lag compensator is used as one control strategy while a generalized sampled hold function is used as a second strategy, to shift the RHP transmission zeros, thereby achieving ZMD. It is observed that merely shifting the RHP zero(s) to the left half plane reduces miss distances signi�cantly even when no additional controllers are used to ensure SPR conditions.

Study of liquid fuel transport in a small carburetted engine in the context of cold-start HC emission control

In the present study, a detailed visualization of the transport of fuel film has been performed in a small carburetted engine with a transparent manifold at the exit of the carburettor. The presence of fuel film is observed significantly on the lower half of the manifold at idling, while at load conditions, the film is found to be distributed all throughout the manifold walls. Quantitative measurement of the fuel film in a specially-designed manifold of square cross section has also been performed using the planar laser-induced fluorescence (PLIF) technique. The measured fuel film thickness is observed to be of the order of 1 nun at idling, and in the range of 0.1 to 0.4 mm over the range of load and speed studied. These engine studies are complemented by experiments conducted in a carburettor rig to study the state of the fuel exiting the carburettor. Laser-based Particle/Droplet Image Analysis (PDIA) technique is used to identify fuel droplets and ligaments and estimate droplet diameters. At a throttle position corresponding to idling, the fuel exiting the carburettor is found to consist of very fine droplets of size less than 15 mu m and large fuel ligaments associated with length scales of the order of 500 mu m and higher. For a constant pressure difference across the carburettor, the fuel consists of droplets with an SMD of the order of 30 mu m. Also, the effect of liquid fuel film on the cold start HC emissions is studied. Based on the understanding obtained from these studies, strategies such as manifold heating and varying carburettor main jet nozzle diameter are implemented. These are observed to reduce emissions under both idling and varying load conditions.

Multi-agent Reinforcement Learning for Traffic Signal Control

Optimal control of traffic lights at junctions or traffic signal control (TSC) is essential for reducing the average delay experienced by the road users amidst the rapid increase in the usage of vehicles. In this paper, we formulate the TSC problem as a discounted cost Markov decision process (MDP) and apply multi-agent reinforcement learning (MARL) algorithms to obtain dynamic TSC policies. We model each traffic signal junction as an independent agent. An agent decides the signal duration of its phases in a round-robin (RR) manner using multi-agent Q-learning with either is an element of-greedy or UCB 3] based exploration strategies. It updates its Q-factors based on the cost feedback signal received from its neighbouring agents. This feedback signal can be easily constructed and is shown to be effective in minimizing the average delay of the vehicles in the network. We show through simulations over VISSIM that our algorithms perform significantly better than both the standard fixed signal timing (FST) algorithm and the saturation balancing (SAT) algorithm 15] over two real road networks.