scholarly journals When is the condition of order preservation met?

2019 ◽  
Vol 277 (1) ◽  
pp. 248-254 ◽  
Author(s):  
Konrad Kułakowski ◽  
Jiří Mazurek ◽  
Jaroslav Ramík ◽  
Michael Soltys
Keyword(s):  
2014 ◽  
Vol 02 (03) ◽  
pp. 243-248 ◽  
Author(s):  
Cheng Song ◽  
Gang Feng

This paper investigates the coverage problem for mobile sensor networks on a circle. The goal is to minimize the largest distance from any point on the circle to its nearest sensor while preserving the mobile sensors' order. The coverage problem is translated into a multi-agent consensus problem by showing that the largest distance from any point to its nearest sensor is minimized if the counterclockwise distance between each sensor and its right neighbor reaches a consensus. Distributed control laws are also developed to drive the mobile agents to the optimal configuration with order preservation. Simulation results illustrate the effectiveness of the proposed control laws.


Author(s):  
Vitaliy V Tsyganok

<p>AHP/ANP stability measurement methods are described. In this paper we define the method's stability as the measure of its results dependence on the expert's errors, made during pair comparisons. Ranking Stability (order preservation in alternative ranking under natural expert's errors, made during expert estimation) and Estimating Stability (maintaining alternative weights within the specified maximal relative inaccuracy range) are considered. Targeted Genetic Algorithm search procedure is used for possible stability violation detection. Then division-in-half (dichotomy) method is applied to calculate stability metric of a given criteria hierarchy.</p><p>http://dx.doi.org/10.13033/ijahp.v3i1.50</p>


Sign in / Sign up

Export Citation Format

Share Document