Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Measurement of complex optical flow with use of an augmented generalized gradient scheme

We present a method for measuring the local velocities and first-order variations in velocities in a time-varying image. The scheme is an extension of the generalized gradient model that encompasses the local variation of velocity within a local patch of the image. Motion within a patch is analyzed in parallel by 42 different spatiotemporal filters derived from 6 linearly independent spatiotemporal kernels. No constraints are imposed on the image structure, and there is no need for smoothness constraints on the velocity field. The aperture problem does not arise so long as there is some two-dimensional structure in the patch being analyzed. Among the advantages of the scheme is that there is no requirement to calculate second or higher derivatives of the image function. This makes the scheme robust in the presence of noise. The spatiotemporal kernels are of simple form, involving Gaussian functions, and are biologically plausible receptive fields. The validity of the scheme is demonstrated by application to both synthetic and real video images sequences and by direct comparison with another recently published scheme [Biol. Cybern. 63, 185 (1990)] for the measurement of complex optical flow.

Capturability of realistic generalized true proportional navigation

The capturability of a realistic generalized true proportional navigation (RGTPN) guidance law, against a nonmaneuvering target, is analyzed. The RGTPN law is obtained by relaxing the somewhat unrealistic assumption of constant closing velocity, made in all earlier studies on generalized true proportional navigation (GTPN), and incorporating the actual time-varying value in the guidance law. Closed-form solutions for the complete capture region of RGTPN is obtained in terms of both zero and acceptable non-zero miss distances. It is shown that the capture region of RGTPN in the initial relative velocity space is significantly smaller than that of GTPN, for reasonable values of navigation constant (N) and angular direction (eta) of the missile commanded latax. However, for certain values of N and eta, capturability of RGTPN is found to be better. It is also shown that if in one of the versions of GTPN, which uses constant values of both the closing velocity and the line-of-sight (LOS) angular velocity in the guidance law, the corresponding realistic time-varying quantities are used, the capture region actually expands to cover the whole of the initial relative velocity space. A number of examples are given to compare the capture performance of RGTPN with other versions of the GTPN guidance laws.

Performance of the generalized delta rule in structural damage detection

The paper examines the suitability of the generalized data rule in training artificial neural networks (ANN) for damage identification in structures. Several multilayer perceptron architectures are investigated for a typical bridge truss structure with simulated damage stares generated randomly. The training samples have been generated in terms of measurable structural parameters (displacements and strains) at suitable selected locations in the structure. Issues related to the performance of the network with reference to hidden layers and hidden. neurons are examined. Some heuristics are proposed for the design of neural networks for damage identification in structures. These are further supported by an investigation conducted on five other bridge truss configurations.

Thomas-Fermi Method For Particles Obeying Generalized Exclusion Statistics

We use the Thomas-Fermi method to examine the thermodynamics of particles obeying Haldane exclusion statistics. Specifically, we study Calogero-Sutherland particles placed in a given external potential in one dimension. For the case of a simple harmonic potential (constant density of states), we obtain the exact one-particle spatial density and a {\it closed} form for the equation of state at finite temperature, which are both new results. We then solve the problem of particles in a $x^{2/3} ~$ potential (linear density of states) and show that Bose-Einstein condensation does not occur for any statistics other than bosons.

Direct Cartesian-Space Solutions of Generalized Bloch Equations in the Rotating Frame

Analytical solutions of the generalized Bloch equations for an arbitrary set of initial values of the x, y, and z magnetization components are given in the rotating frame. The solutions involve the decoupling of the three coupled differential equations such that a third-order differential equation in each magnetization variable is obtained. In contrast to the previously reported solutions given by Torrey, the present attempt paves the way for more direct physical insight into the behavior of each magnetization component. Special cases have been discussed that highlight the utility of the general solutions. Representative trajectories of magnetization components are given, illustrating their behavior with respect to the values of off-resonance and initial conditions. (C) 1995 Academic Press, Inc.

Solving linear programming problems exactly

A linear programming problem in an inequality form having a bounded solution is solved error-free using an algorithm that sorts the inequalities, removes the redundant ones, and uses the p-adic arithmetic. (C) Elsevier Science Inc., 1997

A fixed-grid finite element based enthalpy formulation for generalized phase change problems: role of superficial mushy region

The enthalpy method is primarily developed for studying phase change in a multicomponent material, characterized by a continuous liquid volume fraction (phi(1)) vs temperature (T) relationship. Using the Galerkin finite element method we obtain solutions to the enthalpy formulation for phase change in 1D slabs of pure material, by assuming a superficial phase change region (linear (phi(1) vs T) around the discontinuity at the melting point. Errors between the computed and analytical solutions are evaluated for the fluxes at, and positions of, the freezing front, for different widths of the superficial phase change region and spatial discretizations with linear and quadratic basis functions. For Stefan number (St) varying between 0.1 and 10 the method is relatively insensitive to spatial discretization and widths of the superficial phase change region. Greater sensitivity is observed at St = 0.01, where the variation in the enthalpy is large. In general the width of the superficial phase change region should span at least 2-3 Gauss quadrature points for the enthalpy to be computed accurately. The method is applied to study conventional melting of slabs of frozen brine and ice. Regardless of the forms for the phi(1) vs T relationships, the thawing times were found to scale as the square of the slab thickness. The ability of the method to efficiently capture multiple thawing fronts which may originate at any spatial location within the sample, is illustrated with the microwave thawing of slabs and 2D cylinders. (C) 2002 Elsevier Science Ltd. All rights reserved.

Generalized model for infrared perception from an engine exhaust

A comprehensive scheme has been developed for the prediction of radiation from engine exhaust and its incidence on an arbitrarily located sensor. Existing codes have been modified for the simulation of flows inside nozzles and jets. A novel view factor computation scheme has been applied for the determination of the radiosities of the discrete panels of a diffuse and gray nozzle surface. The narrowband model has been used to model the radiation from the gas inside the nozzle and the nonhomogeneous jet. The gas radiation from the nozzle inclusive of nozzle surface radiosities have been used as boundary conditions on the jet radiation. Geometric modeling techniques have been developed to identify and isolate nozzle surface panels and gas columns of the nozzle and jet to determine the radiation signals incident on the sensor. The scheme has been validated for intensity and heat flux predictions, and some useful results of practical importance have been generated to establish its viability for infrared signature analysis of jets.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

Performance analysis of TCM with generalized selection combining on Rayleigh fading channels

We derive the computational cutoff rate, R-o, for coherent trellis-coded modulation (TCM) schemes on independent indentically distributed (i.i.d.) Rayleigh fading channels with (K, L) generalized selection combining (GSC) diversity, which combines the K paths with the largest instantaneous signal-to-noise ratios (SNRs) among the L available diversity paths. The cutoff rate is shown to be a simple function of the moment generating function (MGF) of the SNR at the output of the (K, L) GSC receiver. We also derive the union bound on the bit error probability of TCM schemes with (K, L) GSC in the form of a simple, finite integral. The effectiveness of this bound is verified through simulations.