19,714 Hits in 5.9 sec

Approximate Optimal Deployment of Barrier Coverage on Heterogeneous Bistatic Radar Sensors

Xianghua Xu, Chengwei Zhao, Zongmao Cheng, Tao Gu
2019 Sensors  
The optimal placement sequence of heterogeneous BR barrier cannot be solved through the greedy algorithm. 3) We propose an optimal BRs placement algorithm on a line barrier when the heterogeneous BR transmitters  ...  Then, we propose an approximate algorithm to optimize the BR placement spacing sequence on the heterogeneous line barrier. 4) As a heterogeneous barrier case study, a minimum cost coverage algorithm of  ...  L * denotes the maximum increase in the length of the linear barrier by placing a receiver at a time and p * denotes the best location at this time.  ... 
doi:10.3390/s19102403 fatcat:u5k4k6mclvhhxprrrl62pvk7y4

Page 7988 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
We identify the candidates for optimal placement(s) for a facility with a fixed orientation and then for a facility with a fixed server location.  ...  There is a 3/4-approximation algorithm for MVC, based on a linear programming relaxation.  ... 

Most vital segment barriers [article]

Irina Kostitsyna and Maarten Löffler and Valentin Polishchuk and Frank Staals
2019 arXiv   pre-print
We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain.  ...  We give hardness results and efficient algorithms for various versions of the problem, (almost) completely separating hard and polynomially-solvable cases.  ...  This gives us a linear-time algorithm for finding a single most vital barrier.  ... 
arXiv:1905.01185v1 fatcat:brgnvjezybbxdemg3qduynsf4y

Rapid optimization of blast wave mitigation strategies using Quiet Direct Simulation and Genetic Algorithm

Matthew R. Smith, Fang-An Kuo, Chih-Wei Hsieh, Jen-Perng Yu, Jong-Shinn Wu, Alex Ferguson
2010 Computer Physics Communications  
Presented is a rapid calculation tool for the optimization of blast wave related mitigation strategies.  ...  The optimization routine employed is a newly developed Genetic Algorithm (GA) which is demonstrated to be similar to a Differential Evolution (DE) scheme with several modifications.  ...  Blast wave mitigation optimization through barrier placement The optimization of a blast wave mitigation strategy through optimal placement of several barriers is investigated.  ... 
doi:10.1016/j.cpc.2010.02.009 fatcat:2q3mfymwnbeqjckx5c3gs66nuq

Multistatic Sensor Placement: A Tracking Approach

Ozgur Erdinc, Peter Willett, Stefano Coraluppi
2006 2006 9th International Conference on Information Fusion  
The optimal placements that result are consistent with our intuition, suggesting that our placement strategy may provide a useful tool in more complex scenarios where intuition is challenged.  ...  It is not always clear what the placement of the sources and receivers that gives the best fused measurement covariance for any target -or at least for any target that is of interest -might be.  ...  The initial placement for optimization is chosen as the optimal placement from figure 9.  ... 
doi:10.1109/icif.2006.301745 dblp:conf/fusion/ErdincWC06 fatcat:4bopii7a7fhllispyxgklyrsge

Artificial Intelligence Versus Conventional Mathematical Techniques: A Review for Optimal Placement of Phasor Measurement Units

Kinfe Negash, Baseem Khan, Estifanos Yohannes
2016 Technology and Economics of Smart Grids and Sustainable Energy  
It is necessary to determine the minimum number of PMUs for entire observability of the power network. The optimal placement of PMUs (OPP) problem can be solved by various techniques.  ...  PMU placement on each bus of a system is difficult to achieve either due to cost factor or due to non-existence limitation of communication facilities in some parts of the system.  ...  Next, a modified algorithm based on integer linear programming model for the optimal placement of these types of PMUs is presented.  ... 
doi:10.1007/s40866-016-0009-y fatcat:tnmgnhkvhvgblbi6wy5puj3ux4

Optimal Static Output Feedback Simultaneous Regional Pole Placement

J.-L. Wu, T.-T. Lee
2005 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
The problem of optimal simultaneous regional pole placement for a collection of linear time-invariant systems via a single static output feedback controller is considered.  ...  Moreover, solution algorithms are provided for finding the optimal solution.  ...  ACKNOWLEDGMENT The authors would like to thank the Associate Editor and the anonymous reviewers for their many helpful suggestions.  ... 
doi:10.1109/tsmcb.2005.846650 pmid:16240765 fatcat:uqa2nuahyrghflgoi7vyxaq53a

Toward Safety-Aware Informative Motion Planning for Legged Robots [article]

Sangli Teng, Yukai Gong, Jessy W. Grizzle, Maani Ghaffari
2021 arXiv   pre-print
map of the environment, 2) a robot's dynamics and safety constraints via discrete-time CBFs and MPC for closed-loop multi-horizon node expansions, and 3) an automatic stopping criterion via setting an  ...  The information-gathering planner takes a dense stochastic map of the environment into account, while safety constraints are enforced via Control Barrier Functions (CBFs).  ...  Funding for J. Grizzle was in part provided by TRI and in part by NSF Award No. 1808051.  ... 
arXiv:2103.14252v1 fatcat:7z5lbckh4bhbpnbsbwoqrsd3vm

Automatic, optimized interface placement in forward flux sampling simulations

Kai Kratzer, Axel Arnold, Rosalind J. Allen
2013 Journal of Chemical Physics  
The methods are demonstrated both for a single-particle test problem and for the crystallization of Yukawa particles.  ...  By removing the need for manual interface placement, our methods both facilitate the setting up of FFS simulations and improve their performance, especially for rare events which involve complex trajectories  ...  Acknowledgments The authors thank Kevin Stratford, Juho Lintuvuori and Chantal Valeriani for helpful discussions.  ... 
doi:10.1063/1.4801866 pmid:23635116 fatcat:734wpke7i5bufch7j7oemvryoa

Discrete Control Barrier Functions for Safety-Critical Control of Discrete Systems with Application to Bipedal Robot Navigation

Ayush Agrawal, Koushil Sreenath
2017 Robotics: Science and Systems XIII  
In this paper, we extend the concept of control barrier functions, developed initially for continuous time systems, to the discrete-time domain.  ...  We show that the resulting formulation is a nonlinear program in contrast to the quadratic program for continuous-time systems and under certain conditions, the nonlinear program can be formulated as a  ...  As we have seen here, the exponential CBF formulation results in a convex optimization problem (particularly a QCQP) for a linear system with quadratic Lyapunov and Barrier functions.  ... 
doi:10.15607/rss.2017.xiii.073 dblp:conf/rss/AgrawalS17 fatcat:hco3xpexhze4nkmky6ezsndokm

An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads

Nachiket Kapre, André Dehon
2011 International Journal of Reconfigurable Computing  
We deliver speedups of 0.5–13× (geomean 3.6×) for Sparse Direct Matrix Solve (Token Dataflow compute model) applied to a range of sparse matrices when using a high-quality placement algorithm.  ...  We perform load balancing, placement, fanout routing, and fine-grained synchronization to optimize our workloads for large networks up to 2025 parallel elements for BSP model and 25 parallel elements for  ...  We use a greedy, linear-time Clustering algorithm similar to the Cluster Growth technique from [17] . We start by creating as many "clusters" as PEs and randomly assign a seed node to each cluster.  ... 
doi:10.1155/2011/745147 fatcat:yqufbquzfnhc5ds3d33higp7q4

Placing a finite size facility with a center objective on a rectangular plane with barriers

Avijit Sarkar, Rajan Batta, Rakesh Nagi
2007 European Journal of Operational Research  
For full containment in a 4-cornered cell, we formulate the problem as a linear program.  ...  This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers.  ...  Optimal placement candidates for the facility with fixed orientation In this section, we deal with the placement of a facility with known orientation a 0 .  ... 
doi:10.1016/j.ejor.2005.08.029 fatcat:ncsdqwylsjbu5hww24d77gyjpy

A Team-Based Methodology of Memory Hierarchy-Aware Runtime Support in Coarray Fortran

Dounia Khaldi, Deepak Eachempati, Shiyao Ge, Pierre Jouvelot, Barbara Chapman
2015 2015 IEEE International Conference on Cluster Computing  
We introduce a new hardware-aware approach for PGAS, to be used within a runtime system, to optimize the communications in the virtual topologies and clusters that are binding different teams together.  ...  We have applied, and implemented into the CAF OpenUH compiler, this methodology to three important collective operations, namely barrier, all-to-all reduction and one-to-all broadcast; this is the first  ...  Our Team Dissemination Linear Barrier (TDLB) algorithm is specified in Algorithm 1 (see [2] for details).  ... 
doi:10.1109/cluster.2015.67 dblp:conf/cluster/KhaldiEGJC15 fatcat:e2y4dkcjbnavlpf6gszmbpxhju

Total power optimization combining placement, sizing and multi-Vt through slack distribution management

Tao Luo, David Newmark, David Z. Pan
2008 2008 Asia and South Pacific Design Automation Conference  
We tested our algorithm on a set of industrial-strength manually optimized circuits from a multi-GHz 65nm microprocessor, and obtained very promising results.  ...  However, power and timing are often conflicting objectives during optimization. In this paper, we propose a novel total power optimization flow under performance constraint.  ...  Linear programming is commonly used for incremental timing driven placement [5, 8, 9, 10, 11] .  ... 
doi:10.1109/aspdac.2008.4483973 dblp:conf/aspdac/LuoNP08 fatcat:6sb56xoe2jdlbodph5mblfsrpu

Optimal Deployment and Scheduling with Directional Sensors for Energy-Efficient Barrier Coverage

Lu Zhao, Guangwei Bai, Yanhui Jiang, Hang Shen, Zhenmin Tang
2014 International Journal of Distributed Sensor Networks  
First, we describe a deployment model for the distribution of sensor locations to analyze whether a target area can be barrier covered.  ...  An efficient scheduling algorithm is proposed to prolong the network lifetime when the target area is barrier covered.  ...  In determined placement, we need to minimize the number of sensors by optimizing their locations to form a barrier.  ... 
doi:10.1155/2014/596983 fatcat:wss4qunhprbx7oz3tr66yxppia
« Previous Showing results 1 — 15 out of 19,714 results