Статті в журналах: "Maximum consensus"

1

Wang, Xin, Jianping He, Peng Cheng, and Jiming Chen. "Differentially Private Maximum Consensus." IFAC-PapersOnLine 50, no. 1 (July 2017): 9509–14. http://dx.doi.org/10.1016/j.ifacol.2017.08.1597.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Aßfalg, André, and Edgar Erdfelder. "CAML—Maximum likelihood consensus analysis." Behavior Research Methods 44, no. 1 (July 27, 2011): 189–201. http://dx.doi.org/10.3758/s13428-011-0138-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Venkategowda, Naveen K. D., and Stefan Werner. "Privacy-Preserving Distributed Maximum Consensus." IEEE Signal Processing Letters 27 (2020): 1839–43. http://dx.doi.org/10.1109/lsp.2020.3029706.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Wiedermann, Gerhard. "Maximum Immunization for Travel: Consensus." Journal of Travel Medicine 2, no. 3 (September 1, 1995): 191–92. http://dx.doi.org/10.1111/j.1708-8305.1995.tb00652.x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Axmann, J., and C. Brenner. "MAXIMUM CONSENSUS LOCALIZATION USING LIDAR SENSORS." ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences V-2-2021 (June 17, 2021): 9–16. http://dx.doi.org/10.5194/isprs-annals-v-2-2021-9-2021.

Повний текст джерела

Анотація:

Abstract. Real world localization tasks based on LiDAR usually face a high proportion of outliers arising from erroneous measurements and changing environments. However, applications such as autonomous driving require a high integrity in all of their components, including localization. Standard localization approaches are often based on (recursive) least squares estimation, for example, using Kalman filters. Since least squares minimization shows a strong susceptibility to outliers, it is not robust.In this paper, we focus on high integrity vehicle localization and investigate a maximum consensus localization strategy. For our work, we use 2975 epochs from a Velodyne VLP-16 scanner (representing the vehicle scan data), and map data obtained using a Riegl VMX-250 mobile mapping system. We investigate the effects of varying scene geometry on the maximum consensus result by exhaustively computing the consensus values for the entire search space. We analyze the deviations in position and heading for a circular course in a downtown area by comparing the estimation results to a reference trajectory, and show the robustness of the maximum consensus localization.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Nakamura, Masahiro, Hideaki Ishii, and Seyed Mehran Dibaji. "Maximum-Based Consensus and Its Resiliency." IFAC-PapersOnLine 51, no. 23 (2018): 283–88. http://dx.doi.org/10.1016/j.ifacol.2018.12.049.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Wen, Fei, Rendong Ying, Zheng Gong, and Peilin Liu. "Efficient Algorithms for Maximum Consensus Robust Fitting." IEEE Transactions on Robotics 36, no. 1 (February 2020): 92–106. http://dx.doi.org/10.1109/tro.2019.2943061.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Chin, Tat-Jun, and David Suter. "The Maximum Consensus Problem: Recent Algorithmic Advances." Synthesis Lectures on Computer Vision 7, no. 2 (February 27, 2017): 1–194. http://dx.doi.org/10.2200/s00757ed1v01y201702cov011.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Nakamura, Masahiro, Hideaki Ishii, and Seyed Mehran Dibaji. "Resiliency against malicious agents in maximum-based consensus." SICE Journal of Control, Measurement, and System Integration 14, no. 1 (January 1, 2021): 279–90. http://dx.doi.org/10.1080/18824889.2021.1988396.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

EDDY, SEAN R., GRAEME MITCHISON, and RICHARD DURBIN. "Maximum Discrimination Hidden Markov Models of Sequence Consensus." Journal of Computational Biology 2, no. 1 (January 1995): 9–23. http://dx.doi.org/10.1089/cmb.1995.2.9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Chen, Yen-Liang, and Li-Chen Cheng. "Mining maximum consensus sequences from group ranking data." European Journal of Operational Research 198, no. 1 (October 2009): 241–51. http://dx.doi.org/10.1016/j.ejor.2008.09.004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Wu, Bang Ye. "Constructing the Maximum Consensus Tree from Rooted Triples." Journal of Combinatorial Optimization 8, no. 1 (March 2004): 29–39. http://dx.doi.org/10.1023/b:joco.0000021936.04215.68.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Yang, Xiao Li, and Dong Xia Li. "Consensus Maximum Margin Criterion for Classification of Proteomic Profile." Applied Mechanics and Materials 556-562 (May 2014): 351–54. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.351.

Повний текст джерела

Анотація:

We propose a new technique for cancer diagnosis from proteomic profile, which mainly contains four steps. Firstly, the original profiles are preprocessed by baseline correction, denoising, compression and rescaling. Then, the profiles are modelled by maximum margin criterion (MMC) analysis. After that, a consensus technique is utilized to identify the discriminant features. Finally, support vector machine (SVM) is applied to classify the modelling data. To study the validity of the proposed method, it is worked on classifying two proteomic profile datasets, the normal and the cancer samples. The results show that the method is efficient.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Wang, Xin, Jianping He, Peng Cheng, and Jiming Chen. "Differentially Private Maximum Consensus: Design, Analysis and Impossibility Result." IEEE Transactions on Network Science and Engineering 6, no. 4 (October 1, 2019): 928–39. http://dx.doi.org/10.1109/tnse.2018.2879795.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Monteiro, João C., and Alessandro Jacoud Peixoto. "Convergence and Stability Properties of a Dynamic Maximum Consensus Estimator." IFAC-PapersOnLine 53, no. 2 (2020): 2885–90. http://dx.doi.org/10.1016/j.ifacol.2020.12.960.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

He, Jianping, Peng Cheng, Ling Shi, Jiming Chen, and Youxian Sun. "Time Synchronization in WSNs: A Maximum-Value-Based Consensus Approach." IEEE Transactions on Automatic Control 59, no. 3 (March 2014): 660–75. http://dx.doi.org/10.1109/tac.2013.2286893.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Bulteau, Laurent, and Markus L. Schmid. "Consensus Strings with Small Maximum Distance and Small Distance Sum." Algorithmica 82, no. 5 (November 4, 2019): 1378–409. http://dx.doi.org/10.1007/s00453-019-00647-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Wang, Zhaowei, Peng Zeng, Mingtuo Zhou, Dong Li, and Jintao Wang. "Cluster-Based Maximum Consensus Time Synchronization for Industrial Wireless Sensor Networks." Sensors 17, no. 12 (January 13, 2017): 141. http://dx.doi.org/10.3390/s17010141.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Jermiin, L. S., G. J. Olsen, K. L. Mengerson, and S. Easteal. "Majority-Rule Consensus of Phylogenetic Trees Obtained by Maximum-Likelihood Analysis." Molecular Biology and Evolution 14, no. 12 (December 1, 1997): 1296–302. http://dx.doi.org/10.1093/oxfordjournals.molbev.a025739.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Chao, Guoqing, and Shiliang Sun. "Consensus and complementarity based maximum entropy discrimination for multi-view classification." Information Sciences 367-368 (November 2016): 296–310. http://dx.doi.org/10.1016/j.ins.2016.06.004.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Zhang, Bowen, Yucheng Dong, and Yinfeng Xu. "Maximum expert consensus models with linear cost function and aggregation operators." Computers & Industrial Engineering 66, no. 1 (September 2013): 147–57. http://dx.doi.org/10.1016/j.cie.2013.06.001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Velasco-Villa, Martín, Josué Heras-Godínez, José Alejandro Vázquez-Santacruz, and Varinia Fragoso-Rubio. "Delayed Consensus Problem for Single and Double Integrator Systems." Mathematical Problems in Engineering 2015 (2015): 1–15. http://dx.doi.org/10.1155/2015/461098.

Повний текст джерела

Анотація:

This work deals with the analysis of the consensus problem for networks of agents constituted by single and double integrator systems. It is assumed that the communication among agents is affected by a constant time-delay. Previous and numerous analysis of the problem shows that the maximum communication time-delay that can be introduced to the network without affecting the consensus of the group of the agents depends on the considered topology. In this work, a control scheme that is based on the estimation of future states of the agents and that allows increasing the magnitude of a possible time-delay affecting the communication channels is proposed. How the proposed delay compensation strategy is independent of the network topology in the sense that the maximum allowable time-delay that could be supported by the network depends on a design parameter and not on the maximum eigenvalue of the corresponding Laplacian matrix is shown. It is formally proven that, under the proposed prediction scheme, the consensus of the group can be achieved by improving the maximum time-delay bounds previously reported in the literature. Numerical simulations show the effectiveness of the proposed solution.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Zong, Siheng, and Yu-Ping Tian. "Consensus of Multi-Agent Systems with Unbounded Time-Varying Delays." Applied Sciences 11, no. 11 (May 27, 2021): 4944. http://dx.doi.org/10.3390/app11114944.

Повний текст джерела

Анотація:

In multi-agent systems with increasing communication distances, the communication delay is time-varying and unbounded. In this paper, we describe the multi-agent system with increasing communication distances as the discrete-time system with non-distributed unbounded time-varying delays and study the consensus problem of the system via the distributed control. This paper uses a time-delay system to model the discrete-time system, and the maximum delay in the time-delay system tends to infinity as time goes on. Furthermore, caused by this property, most of convergence analysis methods for bounded time-delay systems are ineffective. Hence, for any finite integer k>0, the finite-dimensional augmented model of the time-delay system is built in the interval [0,k] to study the system state. Under the weaker topological assumption that the topology containing a spanning tree, the system is proved to achieve a consensus if the growth rate of the maximum delay satisfies some mild constraints, which also are constraints on the growth rate of the maximum communication distance between agents. Furthermore, we characterize that the rate of the system achieving a consensus and the growth rate of the maximum delay are negatively correlated. In other words, the rate of the system achieving a consensus and the growth rate of the maximum communication distance between agents are negatively correlated.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

He, Yan. "Maximum-average Consensus Based Unfixed Cluster Cooperative Spectrum Sensing in Cognitive Radio Systems." Journal of Information and Computational Science 10, no. 17 (November 20, 2013): 5437–47. http://dx.doi.org/10.12733/jics20102374.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Tsuchiya, T., M. Yamaguchi, and T. Kikuno. "Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes." IEEE Transactions on Parallel and Distributed Systems 10, no. 4 (April 1999): 337–45. http://dx.doi.org/10.1109/71.762814.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Zhong, Xiangyu, Xuanhua Xu, and Bin Pan. "A non-threshold consensus model based on the minimum cost and maximum consensus-increasing for multi-attribute large group decision-making." Information Fusion 77 (January 2022): 90–106. http://dx.doi.org/10.1016/j.inffus.2021.07.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Wang, Huiru, and Zhijian Zhou. "Multi-view learning based on maximum margin of twin spheres support vector machine." Journal of Intelligent & Fuzzy Systems 40, no. 6 (June 21, 2021): 11273–86. http://dx.doi.org/10.3233/jifs-202427.

Повний текст джерела

Анотація:

Multi-view learning utilizes information from multiple representations to advance the performance of categorization. Most of the multi-view learning algorithms based on support vector machines seek the separating hyperplanes in different feature spaces, which may be unreasonable in practical application. Besides, most of them are designed to balanced data, which may lead to poor performance. In this work, a novel multi-view learning algorithm based on maximum margin of twin spheres support vector machine (MvMMTSSVM) is introduced. The proposed method follows both maximum margin principle and consensus principle. By following the maximum margin principle, it constructs two homocentric spheres and tries to maximize the margin between the two spheres for each view separately. To realize the consensus principle, the consistency constraints of two views are introduced in the constraint conditions. Therefore, it not only deals with multi-view class-imbalanced data effectively, but also has fast calculation efficiency. To verify the validity and rationlity of our MvMMTSSVM, we do the experiments on 24 binary datasets. Furthermore, we use Friedman test to verify the effectiveness of MvMMTSSVM.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Kenyeres, Martin, and Jozef Kenyeres. "Distributed Mechanism for Detecting Average Consensus with Maximum-Degree Weights in Bipartite Regular Graphs." Mathematics 9, no. 23 (November 25, 2021): 3020. http://dx.doi.org/10.3390/math9233020.

Повний текст джерела

Анотація:

In recent decades, distributed consensus-based algorithms for data aggregation have been gaining in importance in wireless sensor networks since their implementation as a complementary mechanism can ensure sensor-measured values with high reliability and optimized energy consumption in spite of imprecise sensor readings. In the presented article, we address the average consensus algorithm over bipartite regular graphs, where the application of the maximum-degree weights causes the divergence of the algorithm. We provide a spectral analysis of the algorithm, propose a distributed mechanism to detect whether a graph is bipartite regular, and identify how to reconfigure the algorithm so that the convergence of the average consensus algorithm is guaranteed over bipartite regular graphs. More specifically, we identify in the article that only the largest and the smallest eigenvalues of the weight matrix are located on the unit circle; the sum of all the inner states is preserved at each iteration despite the algorithm divergence; and the inner states oscillate between two values close to the arithmetic means determined by the initial inner states from each disjoint subset. The proposed mechanism utilizes the first-order forward and backward finite-difference of the inner states (more specifically, five conditions are proposed) to detect whether a graph is bipartite regular or not. Subsequently, the mixing parameter of the algorithm can be reconfigured the way it is identified in this study whereby the convergence of the algorithm is ensured in bipartite regular graphs. In the experimental part, we tested our mechanism over randomly generated bipartite regular graphs, random graphs, and random geometric graphs with various parameters, thereby identifying its very high detection rate and proving that the algorithm can estimate the arithmetic mean with high precision (like in error-free scenarios) after the suggested reconfiguration.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Dowdy, John C., Eugene A. Czako, Michael E. Stepp, Steven C. Schlitt, Gregory R. Bender, Lateef U. Khan, Kenneth D. Shinneman, Manuel G. Karos, James G. Shepherd, and Robert M. Sayre. "FDA-SUNLAMP RECOMMENDED MAXIMUM TIMER INTERVAL AND EXPOSURE SCHEDULE: CONSENSUS ISO/CIE DOSE EQUIVALENCE." Health Physics 101, no. 3 (September 2011): 227–32. http://dx.doi.org/10.1097/hp.0b013e3182166490.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Ma, Li-Ching. "A new group ranking approach for ordinal preferences based on group maximum consensus sequences." European Journal of Operational Research 251, no. 1 (May 2016): 171–81. http://dx.doi.org/10.1016/j.ejor.2015.10.042.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Peng, Huan Xin, Bin Liu, and De Hong Xu. "Pseudo Two-Hop Distributed Consensus Algorithm with Time-Delay." Applied Mechanics and Materials 364 (August 2013): 192–96. http://dx.doi.org/10.4028/www.scientific.net/amm.364.192.

Повний текст джерела

Анотація:

In this paper, we analyze the pseudo two-hop distributed consensus algorithm with time-delay. If there is time-delay among agents, the convergence performance of distributed consensus algorithms degrades. Supposing that the time-delay in every link is identical and invariant in time and spatial, we analyze the convergence performance of the pseudo two-hop distributed consensus algorithm with time-delay, and calculate the maximum time-delay that the pseudo two-hop algorithm remains stable. Finally, simulation results are provided to verify these analytical results.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Burke, Kelly, Supriya Munshaw, William Osburn, Jordana Levine, Lin Liu, Stuart Ray, and Andrea Cox. "HCV genotype 1a representative sequence elicits broad CD8+ T cell responses (113.10)." Journal of Immunology 188, no. 1_Supplement (May 1, 2012): 113.10. http://dx.doi.org/10.4049/jimmunol.188.supp.113.10.

Повний текст джерела

Анотація:

Abstract Vaccines designed to prevent or to treat hepatitis C viral infection must achieve maximum cross-reactivity against widely divergent circulating strains. Computer-generated sequences minimize genetic distance between circulating strains, and can be generated as a consensus sequence (most common amino acid at each position) or a representative sequence (derived with Bayesian and maximal likelihood phylogenetic tools). Broad recognition of such sequences in HCV has not been demonstrated. Consensus and representative sequences were generated from 390 full-length HCV genotype 1a polypeptide sequences. Sequence mutations in known epitopes were identified by longitudinal sequencing of HCV-infected subjects. Peptides encoding consensus, representative, and variant epitope sequences were tested for the capacity to expand CD8 T cells from HCV-infected subjects and to elicit cross-reactive responses by IFNg ELISpot. The representative and consensus sequences were identical for 9/11 epitopes examined. T cell lines generated against representative sequence peptides were generally cross-reactive to consensus sequence and natural sequence variants. Furthermore, representative sequence peptides generated more robust T cell responses than did natural sequence variant peptides. The broadest recognition of highly diverse circulating HCV strains was achieved using CD8+ T cells expanded with representative sequence HCV. These data support the use of representative sequence in HCV vaccine design.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Ling, Xintong, Zheng Gao, Yuwei Le, Li You, Jiaheng Wang, Zhi Ding, and Xiqi Gao. "Satellite-Aided Consensus Protocol for Scalable Blockchains." Sensors 20, no. 19 (October 1, 2020): 5616. http://dx.doi.org/10.3390/s20195616.

Повний текст джерела

Анотація:

In this work, we propose a satellite-aided permissionless consensus protocol for scalable space–terrestrial blockchains. We design its working principle and workflow by taking full advantage of satellites for extensive coverage and ubiquitous connectivity. Based on the proposed protocol, we demonstrate how such a space–terrestrial blockchain grows and evolves through several typical cases in the presence of adversarial nodes, user misbehavior, and transmission outage. Taking proof of work (PoW) as a benchmark, we assess the system security by considering both adversarial miners and possible colluding satellites. Then, we analyze the maximum blockchain throughput under network capacity limits and evaluate the impact of information propagation delay via a Markov model. Simulation results support that the proposed satellite-aided consensus protocol achieves higher throughput and exhibits greater scalability than PoW.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Gong, Hang, Fangke Wu, Runzhi Liu, Xin Jin, Wei Zhou, and Xing Chu. "Event-Based Sampled-Data Average Consensus." Mathematical Problems in Engineering 2020 (July 18, 2020): 1–13. http://dx.doi.org/10.1155/2020/1586289.

Повний текст джерела

Анотація:

This study addresses one of the most essential distributed control problems in multiagent systems, called the average consensus issue, using a new event-triggered sampling control perspective. Although the continuous-time sampling for average consensus has provided good results currently, a systematic investigation into the continuous-time agent dynamics with sampled-data control inputs under an event-triggered mechanism is critically lacking. The problem considered in this paper can be formulated into an average consensus problem of hybrid systems. The method considers three types of control schemes, among which periodic sampling is integrant. The first scheme is a classical sampling controller reinvestigated through a lemma. The second scheme realizes aperiodic control update as well as periodic communication, while the third scheme achieves both aspects aperiodically. Corresponding sufficient conditions of the aforementioned three schemes are derived such that the asymptotic stability of systems is ensured by using algebraic graph theory, matrix analysis, and Lyapunov theory. The constraints for the allowed sampling period, event parameter, and maximum eigenvalue of graph Laplacian are explicitly derived. Moreover, the potential Zeno behavior of agents due to the sampling control theory is avoided. Thus, a digitally implementable technique is provided. Finally, some numerical examples are provided to verify the effectiveness of the proposed theoretical analysis.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Parvandeh, Saeid, Hung-Wen Yeh, Martin P. Paulus, and Brett A. McKinney. "Consensus features nested cross-validation." Bioinformatics 36, no. 10 (January 27, 2020): 3093–98. http://dx.doi.org/10.1093/bioinformatics/btaa046.

Повний текст джерела

Анотація:

Abstract Summary Feature selection can improve the accuracy of machine-learning models, but appropriate steps must be taken to avoid overfitting. Nested cross-validation (nCV) is a common approach that chooses the classification model and features to represent a given outer fold based on features that give the maximum inner-fold accuracy. Differential privacy is a related technique to avoid overfitting that uses a privacy-preserving noise mechanism to identify features that are stable between training and holdout sets. We develop consensus nested cross-validation (cnCV) that combines the idea of feature stability from differential privacy with nCV. Feature selection is applied in each inner fold and the consensus of top features across folds is used as a measure of feature stability or reliability instead of classification accuracy, which is used in standard nCV. We use simulated data with main effects, correlation and interactions to compare the classification accuracy and feature selection performance of the new cnCV with standard nCV, Elastic Net optimized by cross-validation, differential privacy and private evaporative cooling (pEC). We also compare these methods using real RNA-seq data from a study of major depressive disorder. The cnCV method has similar training and validation accuracy to nCV, but cnCV has much shorter run times because it does not construct classifiers in the inner folds. The cnCV method chooses a more parsimonious set of features with fewer false positives than nCV. The cnCV method has similar accuracy to pEC and cnCV selects stable features between folds without the need to specify a privacy threshold. We show that cnCV is an effective and efficient approach for combining feature selection with classification. Availability and implementation Code available at https://github.com/insilico/cncv. Supplementary information Supplementary data are available at Bioinformatics online.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Qu, Shaojian, Yuanming Li, and Ying Ji. "The mixed integer robust maximum expert consensus models for large-scale GDM under uncertainty circumstances." Applied Soft Computing 107 (August 2021): 107369. http://dx.doi.org/10.1016/j.asoc.2021.107369.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Ya Zhang and Yu-Ping Tian. "Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks." IEEE Transactions on Automatic Control 57, no. 8 (August 2012): 2127–32. http://dx.doi.org/10.1109/tac.2012.2183177.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Ikeda, Takuya, Masaaki Nagahara, and Kenji Kashima. "Maximum Hands-Off Distributed Control for Consensus of Multiagent Systems with Sampled-Data State Observation." IEEE Transactions on Control of Network Systems 6, no. 2 (June 2019): 852–62. http://dx.doi.org/10.1109/tcns.2018.2880296.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Renner, Steffen, Swetlana Derksen, Sebastian Radestock, and Fabian Mörchen. "Maximum Common Binding Modes (MCBM): Consensus Docking Scoring Using Multiple Ligand Information and Interaction Fingerprints." Journal of Chemical Information and Modeling 48, no. 2 (January 23, 2008): 319–32. http://dx.doi.org/10.1021/ci7003626.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Zhang, Bowen, Yucheng Dong, Hengjie Zhang, and Witold Pedrycz. "Consensus mechanism with maximum-return modifications and minimum-cost feedback: A perspective of game theory." European Journal of Operational Research 287, no. 2 (December 2020): 546–59. http://dx.doi.org/10.1016/j.ejor.2020.04.014.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Wei, Heng, Qiang Lv, Nanxun Duo, GuoSheng Wang, and Bing Liang. "Consensus Algorithms Based Multi-Robot Formation Control under Noise and Time Delay Conditions." Applied Sciences 9, no. 5 (March 11, 2019): 1004. http://dx.doi.org/10.3390/app9051004.

Повний текст джерела

Анотація:

In recent years, the formation control of multi-mobile robots has been widely investigated by researchers. With increasing numbers of robots in the formation, distributed formation control has become the development trend of multi-mobile robot formation control, and the consensus problem is the most basic problem in the distributed multi-mobile robot control algorithm. Therefore, it is very important to analyze the consensus of multi-mobile robot systems. There are already mature and sophisticated strategies solving the consensus problem in ideal environments. However, in practical applications, uncertain factors like communication noise, communication delay and measurement errors will still lead to many problems in multi-robot formation control. In this paper, the consensus problem of second-order multi-robot systems with multiple time delays and noises is analyzed. The characteristic equation of the system is transformed into a quadratic polynomial of pure imaginary eigenvalues using the frequency domain analysis method, and then the critical stability state of the maximum time delay under noisy conditions is obtained. When all robot delays are less than the maximum time delay, the system can be stabilized and achieve consensus. Compared with the traditional Lyapunov method, this algorithm has lower conservativeness, and it is easier to extend the results to higher-order multi-robot systems. Finally, the results are verified by numerical simulation using MATLAB/Simulink. At the same time, a multi-mobile robot platform is built, and the proposed algorithm is applied to an actual multi-robot system. The experimental results show that the proposed algorithm is finally able to achieve the consensus of the second-order multi-robot system under delay and noise interference.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Dai, Zexing, Ying Ji, Huijie Zhang, and Panhong Cheng. "Robust Minimum Cost Consensus Model for Multicriteria Decision-Making under Uncertain Circumstances." Discrete Dynamics in Nature and Society 2022 (January 19, 2022): 1–14. http://dx.doi.org/10.1155/2022/2904761.

Повний текст джерела

Анотація:

Recently, the consensus model of group decision-making in uncertain circumstances has received extensive attention. Existing models focus on either minimum cost (maintain the total budget) or maximum utility (improve satisfaction). Based on the minimum cost consensus model, a new multicriteria robust minimum cost consensus model with utility preference is proposed in this paper. Firstly, considering the inherent uncertainty of input data, the unit adjustment cost of experts is described under three robust scenarios. Subsequently, a cost consensus model that expresses the views of decision-makers in a variety of uncertain preference forms such as utility function and Gaussian distribution is proposed. Finally, through the application in emergency decision-making, the cost model and the utility model were compared and analyzed to verify the effectiveness and superiority of the proposed model.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Bai, Shizhen, Hao He, Dan Luo, Mengke Ge, Ruobing Yang, and Xinrui Bi. "A Large-Scale Group Decision-Making Consensus Model considering the Experts’ Adjustment Willingness Based on the Interactive Weights’ Determination." Complexity 2022 (November 17, 2022): 1–26. http://dx.doi.org/10.1155/2022/2691804.

Повний текст джерела

Анотація:

This study proposes a large-scale group decision-making (LSGDM) consensus model considering the experts’ adjustment willingness based on the interactive weights’ determination, which can be applied to an LSGDM problem through a case of earthquake shelters. The main contributions of our research are of three aspects as follows. First, the determination method of the interactive weight, which obtains the DMs’ attitude towards the decision-making results, is presented. The subgroups’ weights are calculated, and the unit adjustment cost for each DM is defined. Second, we introduce an objective consensus threshold by the mean and variance of the consensus level for each subgroup. Subsequently, an identification rule is performed to determine the DM to be adjusted with the large difference and the low adjustment cost. And we developed a novel consensus adjustment method that takes the DMs’ adjustment willingness into account to retain as much original information as possible. Thirdly, in order to reduce the subjectivity of the preset consensus threshold and the maximum number of iterations, an objective consensus termination condition that combines the current group consensus level and the consensus adjustment rate is put forward. Finally, the proposed model has demonstrated its effectiveness and superiority based on the comparative and sensitive analysis through a practical example.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Hussainmiya, B. A. "“Manufacturing Consensus”: The Role of the State Council in Brunei Darussalam." Journal of Southeast Asian Studies 31, no. 2 (September 2000): 321–50. http://dx.doi.org/10.1017/s0022463400017586.

Повний текст джерела

Анотація:

This article examines the history and functions of the Brunei State Council (1907—1959). Although a "rubber stamp" to the British Resident's decisions until 1950, thereafter the Council, dominated by the nominees of a new and strong Sultan, Omar Ali Saifuddin III, became an Achilles heel to the British officialdom that yielded maximum power to the traditional elements under the Constitution promulgated in 1959.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Perez-Salesa, Irene, Rodrigo Aldana-Lopez, and Carlos Sagues. "Precise Dynamic Consensus under Event-Triggered Communication." Machines 11, no. 2 (January 17, 2023): 128. http://dx.doi.org/10.3390/machines11020128.

Повний текст джерела

Анотація:

This work addresses the problem of dynamic consensus, which consists of estimating the dynamic average of a set of time-varying signals distributed across a communication network of multiple agents. This problem has many applications in robotics, with formation control and target tracking being some of the most prominent ones. In this work, we propose a consensus algorithm to estimate the dynamic average in a distributed fashion, where discrete sampling and event-triggered communication are adopted to reduce the communication burden. Compared to other linear methods in the state of the art, our proposal can obtain exact convergence under continuous communication even when the dynamic average signal is persistently varying. Contrary to other sliding-mode approaches, our method reduces chattering in the discrete-time setting. The proposal is based on the discretization of established exact dynamic consensus results that use high-order sliding modes. The convergence of the protocol is verified through formal analysis, based on homogeneity properties, as well as through several numerical experiments. Concretely, we numerically show that an advantageous trade-off exists between the maximum steady-state consensus error and the communication rate. As a result, our proposal can outperform other state-of-the-art approaches, even when event-triggered communication is used in our protocol.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Fahham, Hamidreza, Abolfazl Zaraki, Gareth Tucker, and Mark W. Spong. "Time-Optimal Velocity Tracking Control for Consensus Formation of Multiple Nonholonomic Mobile Robots." Sensors 21, no. 23 (November 30, 2021): 7997. http://dx.doi.org/10.3390/s21237997.

Повний текст джерела

Анотація:

The problem of velocity tracking is considered essential in the consensus of multi-wheeled mobile robot systems to minimise the total operating time and enhance the system’s energy efficiency. This study presents a novel switched-system approach, consisting of bang-bang control and consensus formation algorithms, to address the problem of time-optimal velocity tracking of multiple wheeled mobile robots with nonholonomic constraints. This effort aims to achieve the desired velocity formation in the least time for any initial velocity conditions in a multiple mobile robot system. The main findings of this study are as follows: (i) by deriving the equation of motion along the specified path, the motor’s extremal conditions for a time-optimal trajectory are introduced; (ii) utilising a general consensus formation algorithm, the desired velocity formation is achieved; (iii) applying the Pontryagin Maximum Principle, the new switching formation matrix of weights is obtained. Using this new switching matrix of weights guarantees that at least one of the system’s motors, of either the followers or the leader, reaches its maximum or minimum value by using extremals, which enables the multi-robot system to reach the velocity formation in the least time. The proposed approach is verified in a theoretical analysis along with the numerical simulation process. The simulation results demonstrated that using the proposed switched system, the time-optimal consensus algorithm behaved very well in the networks with different numbers of robots and different topology conditions. The required time for the consensus formation is dramatically reduced, which is very promising. The findings of this work could be extended to and beneficial for any multi-wheeled mobile robot system.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Azimi, Shiva, and Tapan K. Gandhi. "3-D Maximum Likelihood Estimation Sample Consensus for Correspondence Grouping in 3-D Plant Point Cloud." IEEE Sensors Letters 5, no. 6 (June 2021): 1–4. http://dx.doi.org/10.1109/lsens.2021.3075459.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Li, Zongmin, Merrill Liechty, Jiuping Xu, and Benjamin Lev. "A fuzzy multi-criteria group decision making method for individual research output evaluation with maximum consensus." Knowledge-Based Systems 56 (January 2014): 253–63. http://dx.doi.org/10.1016/j.knosys.2013.11.018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

章, 慧娜. "Research on Maximum Experts Consensus Model Considering the Association among Decision-Makers and the Tolerance Behavior." Management Science and Engineering 11, no. 04 (2022): 633–44. http://dx.doi.org/10.12677/mse.2022.114076.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Yang, Janghoon, and Yungho Choi. "LQR-Based Sparsification Algorithms of Consensus Networks." Electronics 10, no. 9 (May 3, 2021): 1082. http://dx.doi.org/10.3390/electronics10091082.

Повний текст джерела

Анотація:

The performance of multiagent systems depends heavily on information flow. As agents are populated more densely, some information flow can be redundant. Thus, there can be a tradeoff between communication overhead and control performance. To address this issue, the optimization of the communication topology for the consensus network has been studied. In this study, three different suboptimal topology algorithms are proposed to minimize the linear quadratic regulator (LQR) cost considering the communication penalty, since the optimal solution requires a brute-force search, which has exponential complexity. The first two algorithms were designed to minimize the maximum eigenvalue of the Riccati matrix for the LQR, while the third algorithm was designed to remove edges sequentially in a greedy manner through evaluating the LQR cost directly. The first and second algorithms differ in that the active edges of a consensus network are determined at the end of the iterations in the first, while sequentially in the second. Numerical evaluations show that the proposed algorithms reduce the LQR cost significantly by optimizing communication topology, while the proposed algorithm may achieve optimal performance with a properly chosen parameterization for a small consensus network. While the three algorithms show similar performance with the increasing number of agents, the quantized terminal cost matrix optimization (QTCMO) algorithm shows significantly less complexity within the order of several tenths than those of the other two algorithms.

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Maximum consensus"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями