# Eduardo PasiliaoAir Force Research Laboratory | WPAFBRL · Munitions Directorate

Eduardo Pasiliao

26.9

## About

85

Publications

3,868

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

682

Citations

Introduction

**Skills and Expertise**

## Publications

Publications (85)

In this work, we study the problem of detecting risk-averse low-diameter clusters in graphs. It is assumed that the clusters represent k-clubs and that uncertain information manifests itself in the form of stochastic vertex weights whose joint distribution is known. The goal is to find a k-club of minimum risk contained in the graph. A stochastic p...

Optimization of Value-at-Risk is an important problem both from theoretical and practical standpoints. It can be represented through a class of chance-constrained optimization problems, which are generally hard to solve. Mixed integer problem formulations with big M constants is a standard way to approach such problems, where tightness of these con...

We consider a stochastic decision problem, with dynamic risk measures, in which multiple risk-averse agents make their decisions to minimize their individual accumulated risk-costs over a finite-time horizon. Specifically, we introduce multi-structure dynamic risk measures induced from conditional g-expectations, where the latter are associated wit...

This paper presents a global optimization approach for solving signomial geometric programming (SGP) problems. We employ an accelerated extended cutting plane (ECP) approach integrated with piecewise linear (PWL) approximations to solve the global optimization of SGP problems. In this approach, we separate the feasible regions determined by the con...

The influence class of network problems models the propagation of influence (an abstraction of cascading beliefs, behaviors, or physical phenomena) in a network. Such problems have applications in social networks, electrical networks, computer networks, viral spreading, and so on. These types of networks have also been studied through the lens of c...

In this paper, we consider a risk-averse decision problem for systems governed by stochastic differential equations with dynamic risk measures, where the classical average performance criteria may not be sufficient to account for how risks to uncertain outcomes are perceived by a decision maker. In particular, we formulate a risk-averse stochastic...

We consider a bilevel extension of the classical linear assignment problem motivated by network interdiction applications. Specifically, given a bipartite graph with two different (namely, the leader’s and the follower’s) edge costs, the follower solves a linear assignment problem maximizing his/her own profit, whereas the leader is allowed to affe...

Network routing problems are often modeled with the assumption that the network structure is deterministic, though they are often subject to uncertainty in many real-life scenarios. In this paper, we study the traveling salesman and the shortest path problems with uncertain topologies modeled by arc failures. We present the formulations that incorp...

In this paper, we consider a risk-averse decision problem for controlled-diffusion processes, with dynamic risk measures, in which multiple risk-averse agents consistently choose their decisions in such a way to minimized their individual accumulated risk-costs over a finite-time horizon. In particular, we introduce multi-structure dynamic risk mea...

In this paper, we consider a risk-averse decision problem for controlled-diffusion processes, with dynamic risk measures, in which there are two risk-averse decision makers (i.e., {\it leader} and {\it follower}) with different risk-averse related responsibilities and information. Moreover, we assume that there are two objectives that these decisio...

More and more businesses use social media to advertise their services. Such businesses typically maintain online social network accounts and regularly update their pages with advertisement messages describing new products and promotions. One recent trend in such businesses’ activity is to offer incentives to individual users for re-posting the adve...

In this paper, we introduce mathematical models for studying a supernetwork that is comprised of closely connected groups of subnetworks. For several related classes of such supernetworks, we explicitly derive an analytical representation of their Laplacian spectra. This work is motivated by an application of spectral graph theory in cooperative co...

This paper proposes three new analytical lower bounds on the clique number of a graph and compares these bounds with those previously established in the literature. Two proposed bounds are derived from the well-known Motzkin–Straus quadratic programming formulation for the maximum clique problem. Theoretical results on the comparison of various bou...

In this paper we consider the problem of identifying the most influential (or central)group of nodes (of some predefined size) in a network. Such a group has the largest value of betweenness centrality or one of its variants, for example, the length-scaled or the bounded-distance betweenness centralities. We demonstrate that this problem can be mod...

In this paper, we consider a risk-averse control problem for diffusion processes, in which there is a partition of the admissible control strategy into two decision-making groups (namely, the {\it leader} and {\it follower}) with different cost functionals and risk-averse satisfactions. Our approach, based on a hierarchical optimization framework,...

Given a simple graph and a constant (Formula presented.), a (Formula presented.)-quasi-clique is defined as a subset of vertices that induces a subgraph with an edge density of at least (Formula presented.). This well-known clique relaxation model arises in a variety of application domains. The maximum (Formula presented.)-quasi-clique problem is t...

We consider the bilevel assignment problem in which each decision maker (i.e., the leader and the follower) has its own objective function and controls a distinct set of edges in a given bipartite graph. The leader acts first by choosing some of its edges. Subsequently, the follower completes the assignment process. The edges selected by the leader...

Wireless communication systems are susceptible to jamming attacks, and a large body of research has investigated jamming and anti-jamming strategies for single communication links. However, attacking single links may not be sufficient to disrupt communications in a network, which may route traffic around jammed links. To date, there has been little...

In this paper, we consider a hierarchical control problem with model uncertainty. Specifically, we consider the following objectives that we would like to accomplish. The first one being of a controllability-type that consists of guaranteeing the terminal state to reach a target set starting from an initial condition; while the second one is keepin...

We consider a controlled-diffusion process pertaining to a chain of distributed systems with random perturbations that satisfies a weak H\"{o}rmander type condition. In particular, we consider a stochastic control problem with the following objectives that we would like to achieve. The first one being of a reachability-type that consists of determi...

In this paper, we consider a chain of distributed systems governed by a degenerate parabolic equation, which satisfies a weak H\"{o}rmander type condition, with a control distributed over an open subdomain. In particular, we consider two objectives that we would like to accomplish. The first one being of a controllability type that consists of guar...

We propose a two-stage stochastic programming framework for designing or identifying " resilient " , or " repairable " structures in graphs whose topology may undergo a stochastic transformation. The repairability of a subgraph satisfying a given property is defined in terms of a budget constraint, which allows for a prescribed number of vertices t...

This study considers a class of critical node detection problems that involves minimization of a distance-based connectivity measure of a given unweighted graph via the removal of a subset of nodes (referred to as critical nodes) subject to a budgetary constraint. The distance-based connectivity measure of a graph is assumed to be a function of the...

This paper introduces and studies the minimum edge blocker dominating set problem (EBDP), which is formulated as follows. Given a vertex-weighted undirected graph and r > 0, remove a minimum number of edges so that the weight of any dominating set in the remaining graph is at least r. Dominating sets are used in a wide variety of graph-based applic...

We present an efficient scenario decomposition algorithm for solving large-scale convex stochas-tic programming problems that involve a particular class of downside risk measures. The considered risk functionals encompass coherent and convex measures of risk that can be represented as an infimal convolution of a convex certainty equivalent, and inc...

Single-Shot Echo-Planar-Imaging (SS-EPI) is the most common method to acquire Diffusion-Weighted-Imaging (DWI) data in clinic due to its immunity to patient motion. However, its image quality is impacted by geometric distortions and poor spatial resolution. While Multi-Shot EPI (MS-EPI) has the potential to achieve high spatial resolution, it suffe...

Various applications require networked agents to cooperatively achieve specified formations. In this paper, formation reconfiguration for a group of identical agents with limited communication capabilities is considered. Since the considered agents are identical, their roles are interchangeable, and each position in the desired formation can be tak...

This paper considers the minimum k -connected d -dominating set problem, which is a fault-tolerant generalization of the minimum connected dominating set ( MCDS) problem. Three integer programming formulations based on vertex cuts are proposed ( depending on whether d < k, d D k, or d > k) and their integer hulls are studied. The separation problem...

We consider a clique relaxation model based on the concept of relative vertex connectivity. It extends the classical definition of a k-vertex-connected subgraph by requiring that the minimum number of vertices whose removal results in a disconnected (or a trivial) graph is proportional to the size of this subgraph, rather than fixed at k. Consequen...

We consider the problem of assigning a group of users with different rate requirements to a set of frequency bands, which may have different bandwidths, when the users access the channel via carrier-sense multiple access (CSMA). For example, in systems that employ dynamic spectrum access (DSA), secondary users may interleave their transmissions int...

We study the minimum vertex blocker clique problem (VBCP),1 which is to remove a subset of vertices of minimum cardinality in a weighted undirected graph, such that the maximum weight of a clique in the remaining graph is bounded above by a given integer r ≥ 1. Cliques are among the most popular concepts used to model cohesive clusters in different...

Fitness landscape theory is a mathematical framework for numerical analysis of search algorithms on combinatorial optimization problems. We study a representation of fitness landscape as a weighted directed graph. We consider out forest and in forest structures in this graph and establish important relationships among the forest structures of a dir...

This study presents an integer programming framework for minimizing the connectivity and cohesiveness properties of a given graph by removing nodes and edges subject to a joint budgetary constraint. The connectivity and cohesiveness metrics are assumed to be general functions of sizes of the remaining connected components and node degrees, respecti...

The maximum clique problem is a classical problem in combinatorial optimization that has a broad range of applications in graph-based data mining, social and biological network analysis and a variety of other fields. This article investigates the problem when the edges fail independently with known probabilities. This leads to the maximum probabili...

In this work, we consider a class of risk-averse maximum weighted subgraph problems (R-MWSP). Namely, assuming that each vertex of the graph is associated with a stochastic weight, such that the joint distribution is known, the goal is to obtain a subgraph of minimum risk satisfying a given hereditary property. We employ a stochastic programming fr...

A multi-agent system is considered that is tasked with the objective of approaching a predetermined target from a desired region to minimize detection, and then simultaneously converging at the target. Only a subset of agents is informed of the bearing to the target and the desired common arrival time; other agents only rely on local communication...

We consider the problems of minimum-cost design and augmentation of directed network clusters that have diameter 2 and maintain the same diameter after the deletion of up to R elements (nodes or arcs) anywhere in the cluster. The property of a network to maintain not only the overall connectivity, but also the same diameter after the deletion of mu...

Critical node detection problems aim to optimally delete a subset of nodes in order to optimize or restrict a certain metric of network fragmentation. In this paper, we consider two network disruption metrics which have recently received substantial attention in the literature: the size of the remaining connected components and the total number of...

We consider the problem of finding the most and the least “influential” or “influenceable” cliques in graphs based on three classical centrality measures: degree, closeness and betweenness. In addition to standard clique betweenness, which is defined as the proportion of shortest paths between any two graph nodes that pass through the clique, we al...

We introduce the concepts of “gravitational” and “elastic” potential energy in the context of networks and investigate their implications on interpreting certain well-known graph-theoretic parameters and optimization problems. In the case of gravitational potential energy, we treat the nodes of a graph as “particles” with masses and consider the po...

A group of wheeled robots with nonholonomic constraints is considered to
rendezvous at a common specified setpoint with a desired orientation while
maintaining network connectivity and ensuring collision avoidance within the
robots. Given communication and sensing constraints for each robot, only a
subset of the robots are aware or informed of the...

Social interactions influence our thoughts, opinions and actions. In this
paper, social interactions are studied within a group of individuals composed
of influential social leaders and followers. Each person is assumed to maintain
a social state, which can be an emotional state or an opinion. Followers update
their social states based on the state...

This paper defines and analyzes a generalization of the classical minimum vertex cover problem to the case of two-layer interdependent networks with cascading node failures that can be caused by two common types of interdependence. Previous studies on interdependent networks mainly addressed the issues of cascading failures from a numerical simulat...

We present a novel framework, namely AADMM, for acceleration of linearized
alternating direction method of multipliers (ADMM). The basic idea of AADMM is
to incorporate a multi-step acceleration scheme into linearized ADMM. We
demonstrate that for a class of convex composite optimization with linear
constraints, AADMM has better rate of convergence...

The paper considers the problem of scheduling packets in wireless broadcast systems under uncertainty with the conditional value-at-risk (CVaR) constraints. In such systems, a server periodically transmits a stream of packets over a broadcast channel. The client that needs to access the data, tunes in to the channel and waits for the next packet. T...

This paper analytically characterizes certain classes of low-diameter strongly attack-tolerant networks of arbitrary size, which are globally optimal in the sense that they contain the minimum possible number of edges. Strong attack tolerance property of level
\(R\) implies that a network preserves connectivity and diameter after the deletion of up...

This paper investigates the synchronization of a network of Euler-Lagrange systems with leader tracking. The Euler-Lagrange systems are heterogeneous and uncertain and contain bounded, exogenous disturbances. Network communication is governed by an undirected topology. The network leader has a time-varying trajectory which is known to only a subset...

We consider a variant of the multidimensional assignment problem (MAP) with decomposable costs in which the resulting optimal assignment is described as a set of disjoint stars. This problem arises in the context of multi-sensor multi-target tracking problems, where a set of measurements, obtained from a collection of sensors, must be associated to...

As missions change or evolve, the formation of a system of networked autonomous vehicles may need to be reconfigured. When the vehicles communicate over a wireless ad hoc network, network connectivity may need to be preserved during the reconfiguration process. In addition, achieving the network topology associated with the desired final physical f...

We study local optima of combinatorial optimization problems. We show that a local search algorithm can be represented as a digraph and apply recent results for spanning forests of a diagraph. We establish a correspondence between the number of local optima and the algebraic multiplicities of eigenvalues of digraph laplacians. We apply our finding...

Social interactions influence our thoughts, opinions and actions. In this paper, social interactions are studied within a group of individuals composed of influential social leaders and follower groupies. Each person is assumed to maintain a social state, which can be an emotional state or an opinion on a social event. Followers update their own st...

In this paper, a class of nonlinear networked control systems (NCS) operating over a shared-channel are considered. For sensor networks and networks requiring information collaboration among various devices, the objective to reduce contention and use the bandwidth limited network resources more efficiently can be achieved by developing “smart” sens...

In this paper, we consider two decomposition schemes for the graph theoretical description of the axial Multidimensional Assignment Problem (MAP). The problem is defined as finding n disjoint cliques of size m with minimum total cost in K
m×n
, which is an m-partite graph with n elements per dimension. Even though the 2-dimensional assignment probl...

In this work, we consider the minimum-risk maximum clique problem on stochastic graphs. Namely, assuming that each vertex of the graph is associated with a random variable describing a cost or a loss, such that the joint distribution of all variables on the graph is known, the goal is to determine a clique in the graph that has the lowest risk, giv...

The Shortest Superstring Problem (SSP) is a combinatorial optimization problem which has attracted the interest of many researchers due to its applications. It can be applied in computational molecular biology problems such as DNA sequencing, and in computer science problems such as string compression. The SSP is an NP-hard problem, and therefore g...

Network traffic in the transport layer of end-to-end congestion networks plays a vital role in effecting the throughput in the Medium Access Control (MAC) layer. Common queue length management techniques on nodes in such networks focus on servicing the packets based on their Quality of Service (QoS) requirements (e.g., Differentiated-Services, or D...

In the Medium Access Control (MAC) layer of a wireless network that uses Carrier Sense Multiple Access (CSMA), the performance is limited by collisions that occur because of carrier sensing delays associated with propagation and the sensing electronics. In this paper, we use a continuous-time Markov model to analyze and optimize the performance of...

In this paper a mobile sensor network is tasked with cooperatively tracking a moving target. Each sensor runs a distributed particle filter to estimate the states of the target. Since some sensors may experience occasional failures or do not trust their own observations, a general case is considered, where only a portion of the sensors have the obs...

In this paper, we present an application of particle filter to target state estimation in an urban environment. The objective is to improve the estimation efficiency by 1) developing an accurate and comprehensive representation of the target task-space and 2) incorporating measurements from the readily available soft information sensors (SIS), e.g....

In this paper we present a control architecture for human-in-the-loop wide area search munitions to reduce operator errors in the presence of unreliable automation and opera- tor cognitive limitations. An optimal input tracking controller with adaptive automation uncertainty compensation and real-time workload assessment is developed to improve the...

In this paper we present a vision-based adaptive pursuit guidance law with an objective to intercept a stationary target in the presence of unknown missile dynamics. The dynamic equations of motion for a missile airframe are derived in terms of the general Euler-Lagrange system of equations. One goal is to amalgamate missile dynamics with the visua...

Autonomous mobile robots, such as unmanned aerial or ground vehicles, will play important roles in future military and commercial applications. Future systems will require the robots to communicate with each other on a peer-to-peer basis over a wireless link and are able to form a networked system such as an ad hoc network. In this paper, we consid...

In this paper, a robust pose (i.e., position and orientation) estimation algorithm using two-views captured by a calibrated monocular camera is presented. A collection of pose hypotheses is obtained when more than the minimum number of feature points required to uniquely identify a pose are available in both the images. The pose hypotheses - unit q...

In this report we describe the progress in developing a control architecture for human-in-the-loop wide area search munitions to reduce operator errors in the presence of unreliable automation and operator cognitive limitations. An optimal input tracking controller with adaptive automation uncertainty compensation and real-time workload assessment...

In this chapter, we consider a class of combinatorial optimization problems on hypergraph matchings that represent multidimensional generalizations of the well-known linear assignment problem (LAP). We present two algorithms for solving randomized instances of MAPs with linear and bottleneck objectives that obtain solutions with guaranteed quality.

The throughput at the medium-access control (MAC) layer in a wireless network, that uses the carrier-sense multiple-access (CSMA) protocol, is degraded by collisions caused by failures of the carrier-sensing mechanism. Two sources of failure in the carrier-sensing mechanism are delays in the carrier sensing mechanism and hidden terminals, in which...

Systems of networked mobile robots, such as unmanned aerial or ground
vehicles, will play important roles in future military and commercial
applications. The communications for such systems will typically be over
wireless links and may require that the robots form an ad hoc network and
communicate on a peer-to-peer basis. In this paper, we consider...

The Multidimensional Assignment Problem (MAP) is an extension of the two-dimensional assignment problem in which we find an
optimal matching of elements between mutually exclusive sets. Although the two-dimensional assignment problem is solvable
in polynomial time, extending the problem to three dimensions makes it
NP\mathcal {NP}
-complete. The c...

The paper presents a Greedy Randomized Adaptive Search Procedure (GRASP) implementation for solving the new integer programming model of the data association problem in target track fusion. To quantify the value of a given noisy sensor measurement to target association, we rely on the maximum likelihood estimate. The multitarget multisensor trackin...

The paper presents a new integer programming model to solve the data association problem in target track fusion. To quantify the value of a given noisy sensor measurement to target association, we rely on the maximum likelihood estimate. The multitarget multisensor tracking (MTMST) problem has traditionally been formulated as a multidimensional ass...

The Silences of the Archives, the Reknown of the Story.
The Martin Guerre affair has been told many times since Jean de Coras and Guillaume Lesueur published their stories in 1561. It is in many ways a perfect intrigue with uncanny resemblance, persuasive deception and a surprizing end when the two Martin stood face to face, memory to memory, befor...

This work investigates two branch and bound algorithms based on different tree representations of the multidimensional assignment problem (MAP). The MAP may be depicted as either an index-based tree in which every level of the tree represents a different value of the first index or as a permutation-based tree that has vertices representing differen...

The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem occurring in applications such as data association and target tracking. In this paper, we investigate characteristics of the mean optimal solution values for random MAPs with axial constraints. Throughout the study, we consider cost coe#cients taken from t...

The Multidimensional Assignment Problem (MAP) is an extension of the two-dimensional assignment problem in which we wish to find an optimal matching of elements between mutually exclusive sets. Although the two-dimensional assignment problem has been shown to be solvable in polynomial time, extending the dimensions to three makes the problem NP-com...

The multidimensional assignment problem (MAP) is an extension of the two-dimensional assignment problem in which we wish to find an optimal matching of elements between two mutually exclusive sets. Although the two-dimensional assignment problem has been shown to be solvable in polynomial time, extending the dimensions to three makes the problem NP...

Two stochastic programming models with an implicit second stage for optimal search patterns is presented. The problem concerns the allocation of search effort in a manner that minimizes the length of time to target detection. This is especially important in the use of autonomous searchers with the capability to locate and identify targets. For our...

A joint probability density function of significant wave height, Hs, and average zero-crossing period, T̄o, is developed as a product of the generalized gamma distribution for the marginal density function f(Hs), and the log-normal distribution for the conditional probability density function f(T̄o | Hs). Based on this probability density function,...