183,503 Hits in 10.0 sec

A Grouping Based Cooperative Driving Strategy for CAVs Merging Problems [article]

Huile Xu, Shuo Feng, Yi Zhang, Li Li
2018 arXiv   pre-print
In general, there are two kinds of cooperative driving strategies, planning based strategy and ad hoc negotiation based strategy, for connected and automated vehicles (CAVs) merging problems.  ...  In contrast, the ad hoc negotiation based strategy runs fast, but it always finds a local optimal solution.  ...  CAV P,i is the ith CAV passing through the merging zone in the passing order P. Obviously, the time complexity of the Algorithm 1 is O(n 1 + n 2 ). III.  ... 
arXiv:1804.01250v1 fatcat:c2eawabhzrfljkkgfishvew44y

Cost Analysis of the Departure-En Route Merge Problem

Michael A. Bolender, G. L. Slater
2000 Journal of Aircraft  
In our analysis of the depar- ture merge problem, conflicts are referred to as either a crossing conflict or a merge conflict.  ...  There are some characteristics that are unique to the departure merge problem. The most obvious is the initial speed difference in the aircraft.  ... 
doi:10.2514/2.2585 fatcat:27cgtt44xjcazk4aykxq4xcmcu

Efficient Dynamic Programming Solution to a Platoon Coordination Merge Problem With Stochastic Travel Times [article]

Sebastian van de Hoef, Karl H. Johansson, Dimos V. Dimarogonas
2017 arXiv   pre-print
By exploiting the characteristics of the problem, we derive bounds on the set of states that have to be explored at every stage, which in turn reduces the complexity of computing the solution.  ...  The problem of maximizing the probability of two trucks being coordinated to merge into a platoon on a highway is considered.  ...  In case the merge fails, the problem can be resolved on the higher planning layer.  ... 
arXiv:1705.04222v1 fatcat:u5svjew6wzbmnjkgio2uz5soci

A Convex Reformulation of the Robust Freeway Network Control Problem with Controlled Merging Junctions [article]

Marius Schmitt, John Lygeros
2018 arXiv   pre-print
For special cases of the FNC problem, in particular the case when all merging flows are controlled, there exist tight convex relaxations of the corresponding optimization problem.  ...  In the freeway network control (FNC) problem, the operation of a traffic network is optimized using only flow control.  ...  A key insight of this work is that the problem of optimal control of uncertain networks with controlled merging flows turns out to be simpler than the problem of predicting tight bounds on the evolution  ... 
arXiv:1803.11163v1 fatcat:6gkqwodkkneqzmugn6dv252l3q

Multiscale Gevrey asymptotics in boundary layer expansions for some initial value problem with merging turning points [article]

Alberto Lastra, Stéphane Malek
2017 arXiv   pre-print
The problem possesses an irregular singularity in time at the origin and involves a set of so-called moving turning points merging to 0 with ϵ.  ...  We show that both outer and inner solutions have Gevrey asymptotic expansions as ϵ tends to 0 on appropriate sets of sectors that cover a neighborhood of the origin in C^∗.  ...  The new equation obtained remains singularly perturbed in ǫ with an irregular singularity at t = 0 and still possess four turning points which merge at 0 as ǫ reachs the origin. Remark 2.  ... 
arXiv:1707.02323v1 fatcat:7hkv37pi5rfotjwbsgus3zm5ym

Bubble merging in breathing DNA as a vicious walker problem in opposite potentials

Jonas Nyvold Pedersen, Mikael Sonne Hansen, Tomáš Novotný, Tobias Ambjörnsson, Ralf Metzler
2009 Journal of Chemical Physics  
In the calculations, we map the bubble dynamics on the problem of two vicious walkers in opposite potentials. We also present a discrete master equation approach to the bubble coalescence problem.  ...  be useful for the quantitative investigation of thermodynamic DNA stability data as well as the rate constants involved in the unzipping and zipping dynamics of DNA, in single molecule fluorescence experiments  ...  N. is a part of the research plan MSM 0021620834 financed by the Ministry of Education of the Czech Republic and was also partly supported by the grant number 202/08/0361 of the Czech Science Foundation  ... 
doi:10.1063/1.3117922 pmid:19405571 fatcat:edumbaczuzh7vnucypkpiknrle

Multiobjective Parallel Chaos Optimization Algorithm with Crossover and Merging Operation

Qingxian Li, Liangjiang Liu, Xiaofang Yuan
2020 Mathematical Problems in Engineering  
In the proposed PCOA, crossover and merging operation will be applied to exchange information between parallel solutions and produce new potential solutions, which can enhance the global and fast search  ...  In this paper, a novel parallel chaos optimization algorithm (PCOA) will be proposed for multiobjective optimization problems (MOOPs).  ...  Acknowledgments is work was supported in part by the National Key R&D Program of China (no. 2018YFF0212900).  ... 
doi:10.1155/2020/1419290 fatcat:ob3equrhbfgbpovbfwlogmwmie

Finding Pareto-Optimal Set by Merging Attractors for a Bi-objective Traveling Salesmen Problem [chapter]

Weiqi Li
2005 Lecture Notes in Computer Science  
Each attractor contains the best solutions found for the corresponding objective. Then, these attractors are merged to find the Pareto-optimal solutions.  ...  This paper presents a new search procedure to tackle multi-objective traveling salesman problem (TSP). This procedure constructs the solution attractor for each of the objectives respectively.  ...  If we merge these two attractors into one matrix, as illustrated in Fig. 5(c) , we can identify other two solutions (1, 2, 4, 5, 3, 6) and (1, 4, 2, 3, 6, 5) .  ... 
doi:10.1007/978-3-540-31880-4_55 fatcat:4ctviflhuvdndpyzgxhnfp4boi

Merge of Evolutionary Computation with Gradient Based Method for Optimization Problems

Joel Hewlett, Bogdan Wilamowski, Gunhan Dundar
2007 2007 IEEE International Symposium on Industrial Electronics  
The proposed method follows the general concept of evolutionary computation, but uses an approximated gradient for generating subsequent populations.  ...  The paper describes an optimization method which combines advantages of both evolutionary computation and gradient based methods.  ...  Fig. 1 . 1 Four iterations in two dimensions Theorem 3. 2 : 2 An n × n matrix A is singular if and only if det(A) = 0 Theorem 3.3: Let A be an n × n matrix.  ... 
doi:10.1109/isie.2007.4375145 fatcat:jyiisvajjvg7xl7wyuptuloohe

The Optimal Time to Merge Two First-Line Insurers with Proportional Reinsurance Policies

Yanan Li, Chuanzheng Li, Jiaqin Wei
2021 Mathematical Problems in Engineering  
In case 2, the two insurers follow the same reinsurance policies as those in case 1 until the sum of their surplus processes reaches a boundary.  ...  We examine the optimal time to merge two first-line insurers with proportional reinsurance policies. The problem is considered in a diffusion approximation model.  ...  1 that the two insurers do not merge; in case 2, the two insurers follow the reinsurance policy (b * 1 , b * 2 ) until the sum of their reserve processes reaches a boundary c, and then they merge and  ... 
doi:10.1155/2021/1423325 fatcat:wyzhc5j2e5g77jb2iihiswx7iq

Percolation on Transitive Graphs as a Coalescent Process: Relentless Merging Followed by Simultaneous Uniqueness [chapter]

Olle Häggström, Yuval Peres, Roberto H. Schonmann
1999 Perplexing Problems in Probability  
For each n, define y n to be the vertex in V \ B(x, L n ) at minimal distance from I x τn (in case of a tie, y n is the one with minimal index in the above enumeration).  ...  Our next result shows that infinite clusters "merge relentlessly" in the intermediate regime (p c , p u ).  ... 
doi:10.1007/978-1-4612-2168-5_4 fatcat:vzh6zo4j65e6vcuytml3oq3vci

Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem [chapter]

Christian Blum, Maria J. Blesa
2016 Lecture Notes in Computer Science  
The applied algorithm, which is labelled Construct, Merge, Solve & Adapt, generates sub-instances based on merging the solution components found in randomly constructed solutions.  ...  In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetitionfree longest common subsequence problem.  ...  A problem instance (S, Σ) consists of a set S = {s 1 , s 2 , . . . , s n } of n input strings over a finite alphabet Σ.  ... 
doi:10.1007/978-3-319-30698-8_4 fatcat:7mw7kvl5e5fwpfykrhdjcsaqpa

Problem of Channel Utilization and Merging Flows in Buffered Optical Burst Switching Networks

Milos Kozak, Brigitte Jaumard, Leos Bohac
2013 Advances in Electrical and Electronic Engineering  
In the paper authors verify two problems of methods of operational research in optical burst switching. The first problem is at edge node, related to the medium access delay.  ...  It is used in to provide a full-featured link of nominal data rate. Simulations of the second problem reveal interesting results.  ...  Acknowledgment The authors would like to thank to grants from Ministry of The Interior of Czech republic under the project name "Guardsence" and number VG20102015053, SGS13/200/OHK3/3T/13, SGS12/186/OHK3  ... 
doi:10.15598/aeee.v11i5.887 fatcat:7wtu6higkfbitmd3hmnzqv3oa4

Merging simulation and projection approaches to solve high-dimensional problems with an application to a new Keynesian model

Lilia Maliar, Serguei Maliar
2015 Quantitative Economics  
The proposed solution algorithm is tractable in problems with high dimensionality (hundreds of state variables) on a desktop computer.  ...  with high dimensionality" and "Merging simulation and projection approaches to solve high-dimensional problems," respectively.  ...  We derive bounds on the number of points in the EDS grids in Proposition 2 of Appendix A.2; however, the exact relation is hard to characterize analytically, in particular, because the cardinality of the  ... 
doi:10.3982/qe364 fatcat:ykmuvqsbevd7rpmpoeywzshxve

Merged Municipalities, Higher Debt: On Free-Riding and the Common Pool Problem in Politics

Henrik Jordahl, Che-Yuan Liang
2009 Social Science Research Network  
We use the 1952 Swedish municipal amalgamation reform to study freeriding and the common pool problem in politics.  ...  of the average increase in income.  ...  They all reach the same conclusion in favor of the law of 1/n. 4 Note, however, the downside of using this convincing instrument: only a small fraction of the whole sample can be used.  ... 
doi:10.2139/ssrn.1019982 fatcat:uipaizrl6nhiraj2r7y2dfplqu
« Previous Showing results 1 — 15 out of 183,503 results