Results 11 to 20 of about 126,892 (230)

Terminal Impact Time Control Cooperative Guidance Law for UAVs under Time-Varying Velocity

open access: yesDrones, 2021
Aiming at the problem that multiple Unmanned Aerial Vehicles (UAVs) attack the stationary target cooperatively under time-varying velocity, the cooperative guidance law with finite time convergence on two-dimensional plan and the three-dimensional ...
Zhanyuan Jiang   +3 more
doaj   +1 more source

Constraint impulsive consensus of nonlinear multi-agent systems with impulsive time windows

open access: yesAIMS Mathematics, 2020
In this paper, the constraint impulsive consensus problem of nonlinear multi-agent systems in directed network is discussed. Impulsive time windows are designed for solving consensus problem of multi-agent systems.
Qiangqiang Zhang   +3 more
doaj   +1 more source

Application of spectral graph theory on the enthalpy change of formation of acyclic saturated ketones

open access: yesJournal of the Serbian Chemical Society, 2018
The dependence of the enthalpy change of formation of saturated acyclic ketones on molecular structure (the number of carbon atoms, the position of the carbonyl group, and the branching of the molecules) was investigated. For this purpose, a simple computational model, the parameterization of which is based on spectral graph theory, was developed.
Ana Gligorijevic   +3 more
openaire   +4 more sources

Using Graph Theory to Assess the Interaction between Cerebral Function, Brain Hemodynamics, and Systemic Variables in Premature Infants

open access: yesComplex, 2018
Graphs can be used to describe a great variety of real-world situations and have therefore been used extensively in different fields. In the present analysis, we use graphs to study the interaction between cerebral function, brain hemodynamics, and ...
Dries Hendrikx   +6 more
semanticscholar   +1 more source

A general bound for the induced poset saturation problem

open access: yesEuropean Conference on Combinatorics, Graph Theory and Applications, 2023
For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, then $P$ is an induced subposet of ...
Andrea Freschi   +3 more
semanticscholar   +1 more source

Formation Control of Multiple Unmanned Surface Vehicles Using the Adaptive Null-Space-Based Behavioral Method

open access: yesIEEE Access, 2019
This paper presents an adaptive null-space-based behavioral (NSB) method to deal with the problems of saturation planning and lack of adaptability when the traditional NSB method is applied to the formation control of multiple unmanned surface vehicles ...
Jiajia Fan   +5 more
doaj   +1 more source

The Game Saturation Number of a Graph [PDF]

open access: yesJournal of Graph Theory, 2014
Given a family F and a host graph H, a graph G⊆H is F ‐saturated relative to H if no subgraph of G lies in F but adding any edge from E(H)−E(G) to G creates such a subgraph.
James M. Carraher   +3 more
semanticscholar   +1 more source

Weak Rainbow Saturation Numbers of Graphs [PDF]

open access: yesJournal of Graph Theory
For a fixed graph H H , we say that an edge‐colored graph G G is weakly H H ‐rainbow saturated if there exists an ordering e 1 , e 2 , … , e m e1,e2,\unicode{x02026},em of E ( G ¯ ) E(G\unicode{x000AF}) such that, for any list c 1 , c 2 , … , c m c1,c2 ...
Xihe Li, Jie Ma, Tianying Xie
semanticscholar   +1 more source

A Cascaded Structure for Generalized Graph Filters

open access: yesIEEE Transactions on Signal Processing, 2022
One of the main challenges of graph filters is the stability of their design. While classical graph filters allow for a stable design using optimal polynomial approximation theory, generalized graph filters tend to suffer from the ill-conditioning of the
M. Coutiño, G. Leus
semanticscholar   +1 more source

A bilinear system approach with input saturation to control the agreement value of multi-agent systems

open access: yesEuropean Control Conference, 2022
While reaching an agreement in multi-agent sys-tems (MAS) can be ensured by enforcing some connectivity properties between agents, the consensus depends on their initial conditions and the network topology.
Daniel R. Alkhorshid   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy