119 resultados para Orbital search
Resumo:
We present a frontier based algorithm for searching multiple goals in a fully unknown environment, with only information about the regions where the goals are most likely to be located. Our algorithm chooses an ``active goal'' from the ``active goal list'' generated by running a Traveling Salesman Problem (Tsp) routine with the given centroid locations of the goal regions. We use the concept of ``goal switching'' which helps not only in reaching more number of goals in given time, but also prevents unnecessary search around the goals that are not accessible (surrounded by walls). The simulation study shows that our algorithm outperforms Multi-Heuristic LRTA* (MELRTA*) which is a significant representative of multiple goal search approaches in an unknown environment, especially in environments with wall like obstacles.
Resumo:
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions in this paper are two-fold. First, we propose a low-complexity algorithm for large-MIMO detection based on a layered low-complexity local neighborhood search. Second, we obtain a lower bound on the maximum-likelihood (ML) bit error performance using the local neighborhood search. The advantages of the proposed ML lower bound are i) it is easily obtained for MIMO systems with large number of antennas because of the inherent low complexity of the search algorithm, ii) it is tight at moderate-to-high SNRs, and iii) it can be tightened at low SNRs by increasing the number of symbols in the neighborhood definition. Interestingly, the proposed detection algorithm based on the layered local search achieves bit error performances which are quite close to this lower bound for large number of antennas and higher-order QAM. For e. g., in a 32 x 32 V-BLAST MIMO system, the proposed detection algorithm performs close to within 1.7 dB of the proposed ML lower bound at 10(-3) BER for 16-QAM (128 bps/Hz), and close to within 4.5 dB of the bound for 64-QAM (192 bps/Hz).
Resumo:
Unmanned aerial vehicles (UAVs) have the potential to carry resources in support of search and prosecute operations. Often to completely prosecute a target, UAVs may have to simultaneously attack the target with various resources with different capacities. However, the UAVs are capable of carrying only limited resources in small quantities, hence, a group of UAVs (coalition) needs to be assigned that satisfies the target resource requirement. The assigned coalition must be such that it minimizes the target prosecution delay and the size of the coalition. The problem of forming coalitions is computationally intensive due to the combinatorial nature of the problem, but for real-time applications computationally cheap solutions are required. In this paper, we propose decentralized sub-optimal (polynomial time) and decentralized optimal coalition formation algorithms that generate coalitions for a single target with low computational complexity. We compare the performance of the proposed algorithms to that of a global optimal solution for which we need to solve a centralized combinatorial optimization problem. This problem is computationally intensive because the solution has to (a) provide a coalition for each target, (b) design a sequence in which targets need to be prosecuted, and (c) take into account reduction of UAV resources with usage. To solve this problem we use the Particle Swarm Optimization (PSO) technique. Through simulations, we study the performance of the proposed algorithms in terms of mission performance, complexity of the algorithms and the time taken to form the coalition. The simulation results show that the solution provided by the proposed algorithms is close to the global optimal solution and requires far less computational resources.
Resumo:
The He I photoelectron spectrum of the diethyl ether-ICl complex has been obtained. The oxygen orbitals are shifted to higher binding energies and that of ICl to lower binding energies owing to complex formation. Ab initio molecular orbital (MO) calculations of the complex molecule showed that the bonding is between the sigma-type lone pair of oxygen and the I atom and that the complex has C-2v symmetry. The binding energy of the complex is computed to be 8.06 kcal mol(-1) at the MP2/3-21G* level. The orbital energies obtained from the photoelectron spectra of the complex are compared and assigned with orbital energies obtained by MO calculations. Natural bond orbital analysis (NBO) shows that charge transfer is from the sigma-type oxygen lone pair to the iodine atom and the magnitude of charge transfer is 0.0744 e.
Resumo:
This paper addresses the problem of automated multiagent search in an unknown environment. Autonomous agents equipped with sensors carry out a search operation in a search space, where the uncertainty, or lack of information about the environment, is known a priori as an uncertainty density distribution function. The agents are deployed in the search space to maximize single step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for the proposed sequential deploy and search strategy. It is shown that with the proposed control law the agent trajectories converge in a globally asymptotic manner to the centroidal Voronoi configuration. Simulation experiments are provided to validate the strategy. Note to Practitioners-In this paper, searching an unknown region to gather information about it is modeled as a problem of using search as a means of reducing information uncertainty about the region. Moreover, multiple automated searchers or agents are used to carry out this operation optimally. This problem has many applications in search and surveillance operations using several autonomous UAVs or mobile robots. The concept of agents converging to the centroid of their Voronoi cells, weighted with the uncertainty density, is used to design a search strategy named as sequential deploy and search. Finally, the performance of the strategy is validated using simulations.
Resumo:
EHT calculations on heterotrinuclear cobalt(III) complexes of the type [Cu{(OH)(2)Co(L(4))}(2)](4+) where L(4) denotes (en)(2) or (NH3)(4), en = ethylenediamine and their component species have been carried out. The results regarding bonding and structure for the trinuclear complexes are compared with those for the monomer components such as [Co(en)(2)(OH)(2)](+), [Co(NH3)(4)(OH)(2)](+) and [Cu(OH)(4)](2-) are discussed.
Resumo:
Genetic Algorithms are efficient and robust search methods that are being employed in a plethora of applications with extremely large search spaces. The directed search mechanism employed in Genetic Algorithms performs a simultaneous and balanced, exploration of new regions in the search space and exploitation of already discovered regions.This paper introduces the notion of fitness moments for analyzing the working of Genetic Algorithms (GAs). We show that the fitness moments in any generation may be predicted from those of the initial population. Since a knowledge of the fitness moments allows us to estimate the fitness distribution of strings, this approach provides for a method of characterizing the dynamics of GAs. In particular the average fitness and fitness variance of the population in any generation may be predicted. We introduce the technique of fitness-based disruption of solutions for improving the performance of GAs. Using fitness moments, we demonstrate the advantages of using fitness-based disruption. We also present experimental results comparing the performance of a standard GA and GAs (CDGA and AGA) that incorporate the principle of fitness-based disruption. The experimental evidence clearly demonstrates the power of fitness based disruption.
Resumo:
The search for homologous sequences promoted by RecA protein in vitro involves a presynaptic filament and naked duplex DNA, the multiple contacts of which produce nucleoprotein networks or coaggregates. The single-stranded DNA within the presynaptic filaments, however, is extended to an axial spacing 1.5 times that of B-form DNA. To investigate this paradoxical difference between the spacing of bases in the RecA presynaptic filament versus the target duplex DNA, we explored the effect of heterologous contacts on the conformation of DNA, and vice versa. In the presence of wheat germ topoisomerase I, RecA presynaptic filaments induced a rapid, limited reduction in the linking number of heterologous circular duplex DNA. This limited unwinding of heterologous duplex DNA, termed heterologous unwinding, was detected within 30 seconds and reached a steady state within a few minutes. Presynaptic filaments that were formed in the presence of ATP?S and separated from free RecA protein by gel filtration also generated a ladder of topoisomers upon incubation with relaxed duplex DNA and topoisomerase. The inhibition of heterologous contacts by 60 mImage -NaCl or 5 mImage -ADP resulted in a corresponding decrease in heterologous unwinding. In reciprocal fashion, the stability or number of heterologous contacts with presynaptic filaments was inversely related to the linking number of circular duplex DNA. These observations show that heterologous contacts with the presynaptic filament cause a limited unwinding of the duplex DNA, and conversely that the ability of the DNA to unwind stabilizes transient heterologous contacts.
Resumo:
It is well known that the increasing space activities pose a serious threat to future missions. This is mainly due to the presence of spent stages, rockets spacecraft and fragments which can lead to collisions. The calculation of the collision probability of future space vehicles with the orbital debris is necessary for estimating the risk. There is lack of adequately catalogued and openly available detailed information on the explosion characteristics of trackable and untrackable debris data. Such a situation compels one to develop suitable mathematical modelling of the explosion and the resultant debris environment. Based on a study of the available information regarding the fragmentation, subsequent evolution and observation, it turns out to be possible to develop such a mathematical model connecting the dynamical features of the fragmentation with the geometrical/orbital characteristics of the debris and representing the environment through the idea of equivalent breakup. (C) 1997 COSPAR.
Resumo:
The He I photoelectron spectra of bromine, methylamine, and their complex have been obtained, and the spectra show that lone-pair orbital energy of nitrogen in methylamine is stabilized by 1.8 eV and the bromine orbital energies are destabilized by about 0.5 eV due to complexation. Ab initio calculations have been performed on the charge-transfer complexes of Br-2 with ammonia and methyl-, dimethyl-, and trimethylamines at the 3-21G*, 6-311G, and 6-311G* levels and also with effective core potentials. Calculations predict donor and acceptor orbital energy shifts upon complexation, and there is a reasonable agreement between the calculated and experimental results. Complexation energies have been corrected for BSSE. Frequency analysis has confirmed that ammonia and trimethylamine form complexes with C-3v symmetry and methylamine and dimethylamine with C-s symmetry. Calculations reveal that the lone-pair orbital of nitrogen in amine and the sigma* orbital of Br-2 are involved in the charge-transfer interaction. LANL1DZ basis seems to be consistent and give a reliable estimate of the complexation energy. The computed complexation energies, orbital energy shifts, and natural bond orbital analysis show that the strength of the complex gradually increases from ammonia to trimethylamine.
Resumo:
We present the results of sub-mm, mm (850 mum, 450 mum and 1250 mum) and radio (1.4 and 4.8 GHz) continuum observations of a sample of 27 K-selected Extremely Red Objects, or EROs, (14 of which form a complete sample with K < 20 and I - K > 5) aimed at detecting dusty starbursts, deriving the fraction of UltraLuminous Infrared Galaxies (ULIGs) in ERO samples, and constraining their redshifts using the radio-FIR correlation. One ERO was tentatively detected at 1250 mum and two were detected at 1.4 GHz, one of which has a less secure identification as an ERO counterpart. Limits on their redshifts and their star forming properties are derived and discussed. We stacked the observations of the undetected objects at 850 mum, 1250 mum and 4.8 GHz in order to search for possible statistical emission from the ERO population as a whole, but no significant detections were derived either for the whole sample or as a function of the average NIR colours. These results strongly suggest that the dominant population of EROs with K < 20 is not comprised of ULIGs like HR 10, but is probably made of radio-quiet ellipticals and weaker starburst galaxies with L < 10(12) L . and SFR < few hundred M. yr(-1).
Resumo:
Neutron powder diffraction measurements on Ca2FeReO6 reveal that this double perovskite orders ferrimagnetically and shows anomalous lattice parameter behavior below T-C=521 K. Below similar to300 K and similar to160 K we observe that the high-T monoclinic crystal structure separates into two and three monoclinic phases, respectively. A magnetic field suppresses the additional phases at low T in favor of the highest-T phase. These manifestations of the orbital degree of freedom of Re 5d electrons indicate that these electrons are strongly correlated and the title compound is a Mott insulator, with competing spin-orbitally ordered states.
Resumo:
Bid optimization is now becoming quite popular in sponsored search auctions on the Web. Given a keyword and the maximum willingness to pay of each advertiser interested in the keyword, the bid optimizer generates a profile of bids for the advertisers with the objective of maximizing customer retention without compromising the revenue of the search engine. In this paper, we present a bid optimization algorithm that is based on a Nash bargaining model where the first player is the search engine and the second player is a virtual agent representing all the bidders. We make the realistic assumption that each bidder specifies a maximum willingness to pay values and a discrete, finite set of bid values. We show that the Nash bargaining solution for this problem always lies on a certain edge of the convex hull such that one end point of the edge is the vector of maximum willingness to pay of all the bidders. We show that the other endpoint of this edge can be computed as a solution of a linear programming problem. We also show how the solution can be transformed to a bid profile of the advertisers.
Resumo:
Efficiency of organic photovoltaic cells based on organic electron donor/organic electron acceptor junctions can be strongly improved when the transparent conductive Anode is coated with a Buffer Layer (ABL). Here, the effects of a metal (gold) or oxide (molybdenum oxide) ABL are reported, as a function of the Highest Occupied Molecular Orbital (HOMO) of different electron donors. The results indicate that a good matching between the work function of the anode and the highest occupied molecular orbital of the donor material is the major factor limiting the hole transfer efficiency. Indeed, gold is efficient as ABL only when the HOMO of the organic donor is close to its work function Phi(Au). Therefore we show that the MoO(3) oxide has a wider field of application as ABL than gold. (C) 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
Resumo:
In this thesis we address the problem of multi-agent search. We formulate two deploy and search strategies based on optimal deployment of agents in search space so as to maximize the search effectiveness in a single step. We show that a variation of centroidal Voronoi configuration is the optimal deployment. When the agents have sensors with different capabilities, the problem will be heterogeneous in nature. We introduce a new concept namely, generalized Voronoi partition in order to formulate and solve the heterogeneous multi-agent search problem. We address a few theoretical issues such as optimality of deployment, convergence and spatial distributedness of the control law and the search strategies. Simulation experiments are carried out to compare performances of the proposed strategies with a few simple search strategies.