




已阅读5页,还剩24页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
For offi ce use only T1 T2 T3 T4 Team Control Number 55583 Problem Chosen C For offi ce use only F1 F2 F3 F4 2017 MCM/ICM Summary Sheet Self-driving vehicles prospect in traffi c network Summary We construct a Mixed Cooperation model to simulate each section of the traffi c network independently based on Cellular Automata. We assume that self-driving vehicles need no safety interval compared with non-self-driving ones because of good synchronization with the former vehicle. And also, we assume that the junctions have little infl uence on simulation because the traffi c performance is relatively continuous. Our Mixed Cooperation model contains three main part. First, in our basic model, we presume that traffi c counts satisfi es uniform distribution in a day. We know the traffi c count and lanes of each section of the traffi c network , so we can get the traffi c density of each road section in a period and continue to use different self-driving ratio to simulate the traffi c fl ow. Next, in our time-based model, we take time model into considera- tion. We presume that traffi c density function over time is identical to dual-Gaussian distribution in a day, which means that there are two period of traffi c peaks. So we can get the traffi c density of each road section in each period of one day and continue to simulate similarly as the basic model. Further, basedonourtime-basedmodel, weconstructadedication- model, considering dedicated lanes for self-driving vehicles and con- tinue to simulate similarly as the time-based model. In conclusion, we use the average velocity of vehicles in each road section in each period to evaluate the performance and capacity. Our models give the result of effect of self-driving on traffi c performance under different traffi c density. Furthermore, our models point out the condition of needing dedicated lanes for self-driving vehicles. Keywords: Traffi c fl ow; Self-driving; Cooperating system; Governor Jay Inslee Offi ce of the Governor PO Box 40002 Olympia, WA 98504-0002 Dear Governor Inslee: I write to you on behalf of the MCM team 55583. We are extremely concerned about the traffi c condition in the Great Seattle area. Investigation shows that the traffi c fl ow usually exceeds the traffi c capacity in many regions in the Great Seattle, especially during peak hours. We hope to help you improve the traffi c conditions. The current traffi c condition could lead to many severe problems. The fi rst problem is unacceptable delay during peak hours.During the morning commute and at the end of the day these delays become extreme long. Also it could lead to congested roads, and potentially increase the probability of occurrence of traffi c accidents. Congested roads could also cause problems for emergency vehicles, making them unable to respond in an appropriate amount of time. After an in-depth study of the traffi c conditions in the Great Seattle area, we have come up with some ideas that can help address this issue. We propose self- driving, cooperating cars as a solution to increase the traffi c capacity without building extra lanes. Compared to human-drived cars, self-driving cars have many advantages. The biggest advantage is that it take much less time to react in terms of emer- gency. This actually allows self-driving cars to keep a closer distance with the car in front of it, thus it takes up much less traffi c resource. In addition to this, self driving cars can tune their acceleration and deceleration profi les to consume less fuel. Thoseadvantagesmentionedabovemakeself-drivingcarsanexcellentchoice for addressing heavy traffi c load. We build a model to simulate the traffi c fl ow of the most busy roads in the Great Seattle area and evaluate the effectiveness of self-driving cars addressing the problem of heavy traffi c load. The simula- tion shows promising results. The introduction of self-driving cars makes all cars among all roads in the Great Seattle area go faster, it works especially well among busy roads during traffi c peak hours. When no self-driving cars are in- troduced, the traffi c goes very slow during peak hours, but after introducing approximately 50% self-driving cars the traffi c fl ow goes 1.5 2 times faster. In addition to making traffi c fl ow faster, self-driving cars also make traffi c fl ow more stable. From our simulation, we observed that introduction of self- driving cars help to reduce the variance of traffi c delay. This is important because it helps to estimate times, and helps to reduce just in case time. For the above reasons, we propose self-driving cars as a solution to heavy traffi c load in the Great Seattle. We appreciate all that you do for this city, and we look forward to seeing positive changes. We hope you can accept out advices. Sincerely yours MCM 2017 Team 55583 Team # 55583 Contents 1Introduction1 1.1Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 1.2Related Work. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .1 2Assumptions and Notations2 2.1Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 2.2Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 3Model Construction3 3.1The self-driving, cooperating car model . . . . . . . . . . . . . . . .3 3.2The mixed, dynamic road model . . . . . . . . . . . . . . . . . . . .4 3.3Performance evaluation criteria . . . . . . . . . . . . . . . . . . . . .6 3.3.1Car Velocity v . . . . . . . . . . . . . . . . . . . . . . . . . . .6 3.3.2Daily Equilibria 1 2 t , 1 2 s . . . . . . . . . . . . . . . . . . . . . .6 4Model Extension and Simulation Analysis7 4.1 Problem1: The effects of auto-driving cars in traffi c network . . . .7 4.1.1Car Velocity/Performance v. . . . . . . . . . . . . . . . . .8 4.1.2Space Daily Equilibria 1/2 s . . . . . . . . . . . . . . . . . . .8 4.1.3Sensitivity Analysis. . . . . . . . . . . . . . . . . . . . . . .10 4.2Problem2: The different effects on peak/average hours . . . . . . .10 4.2.1 Traffi c Density Distribution of Time . . . . . . . . . . . . . .10 4.2.2Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . .10 4.2.3Sensitivity Analysis. . . . . . . . . . . . . . . . . . . . . . .13 4.3Problem3: Dedicated lane assessment. . . . . . . . . . . . . . . . .15 4.3.1Sensitivity analysis . . . . . . . . . . . . . . . . . . . . . . . .16 5Strengths and Weaknesses17 5.1Strengths . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .17 5.2Weaknesses. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .17 Team # 55583 5.3Future work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .17 6Conclusion18 Appendices20 Appendix A Cellular automata program:Moving behavior20 Appendix BCellular automata program:Create new vehicles23 Appendix C Cellular automata program:Create new vehicles considering dedicated lanes23 Team # 55583Page 1 of 24 1Introduction 1.1Problem Statement Traffi c capacity is limited in many regions of the United States due to the num- ber of lanes of roads. For example, in the Greater Seattle area drivers experi- ence long delays during peak traffi c hours because the volume of traffi c exceeds the designed capacity of the road networks. This is particularly pronounced on Interstates 5, 90, and 405, as well as State Route 520, the roads of particular in- terest for this problem. Self-driving, cooperating cars have been proposed as a solution to increase capacity of highways without increasing number of lanes or roads. The behavior of these cars interacting with the existing traffi c fl ow and each other is not well understood at this point. Based on the road listed above in Thurston, Pierce, King, and Snohomish counties, we considered how the ef- fects would change as the percentage of self-driving cars increases from 10% to 50% to 90%, and the equilibria as well as the tipping point where performance changes markedly. Also we simulated that under what conditions, if any, should lanes be dedicated to these cars. Based on our model, we listed several practical suggestions to the local government. 1.2Related Work Traffi c fl ow has been researched for a long time by many people.We can get some basic models about relationship among traffi c density, speed and through- put5.When traffi c density is medium, there is a linear relationship: Speed = Maximum Speed (1 traffic density Maximum density )(1) When traffi c density is nearly full, there is a logarithmic relationship: Speed = Maximum Speed ln(Maximum density traffic density )(2) When traffi c density is very low, there is a exponential relationship: Speed = Maximum Speed (1 exp(Maximum density traffic density )(3) Self-driving has entered our vision and may be popular in the future.The accu- racy and safety have been improved a lot thanks to the development of artifi - cial intelligence.One of the most important point is the sensors on the vehicle1, which can detect the motion state of the surrounding vehicles, including velocity, distance and acceleration.So, in our models, we assume that self-driving vehicles can keep the same motion state with the former one, without safe interval. Team # 55583Page 2 of 24 2Assumptions and Notations 2.1Assumptions We make the following basic assumptions in order to simplify the problem. Each of our assumptions is justifi ed and is consistent with the basic fact. Time consumed on the crossroads and toll on the roads is not in consid- eration. We suppose that the cars are in the same speed and ignored the wasted time due to the road conditions. The traffi c counts on the specifi c roads will not change after adjustment. We presume that at certain day or certain hours the car that need to use certain road will not change because of our adjustment. No lane changing situation is considered. This assumption will be ex- plained in 3.1 when we illustrate the self-driving, cooperating car model. The capacities and sizes of different kinds of cars will not be differenti- ated. To simplify our model, we assume that all the car in our model share the same regular length 4m and regular width for one car a lane. 2.2Notations The notation table contains all the notations we use in this paper. Symbol Defi nitionNotes vinsinstantaneous speed of a car tresponsethe response time of a human driverequals 1s luunit length of a block in Cellular Automaton modelequals 4m nllane counts of a certain road section dthe distance between two adjacent cars LRthe whole length of a certain road section Vmaxthe maximum speed that a car can reachequals7units/s TC traffi c count during a certain time slotTC during a day TC24is a constant vcar velocity tavgthe average car passing time 2 t car velocity variance during different period in a day 2 s car velocity variance among different road sections Pselfthe possibility of a self-driving car to show up PNselfthe possibility of a non-self-driving car to show up Table 1: Notations. Team # 55583Page 3 of 24 3Model Construction 3.1The self-driving, cooperating car model From article 1 and 2, we can know that the self-driving, cooperating cars have four potential benefi ts: Fewer accidents. Driverless car can dramatically reduce the accident toll due to drivers error. More productive commutes. Driverless cars would enable the unproduc- tivehoursandminutestobeconvertedintoproductiveworkand/orleisure time. In other word, self-driving car can help reduce the useless waste on time. Environmental friendliness. Autonomous cars and trucks can tune their acceleration and deceleration profi les to reduce wasted fuel. Fewer traffi c jams. Driverless cars would be better adapted to higher vol- umes of traffi c, as they would be able to travel at higher speeds while keep- ing shorter distances between vehicles. In our model, we paid special attention to the forth benefi t and considered a lot about the self-driving cars effects on traffi c jams. A self-driving, cooperating car is guided by internal computers and exter- nal sensors, and it can communicate and exchange datas with other self-driving, cooperating cars as it decides what to do. In our model, we think self-driving, cooperating cars can better deal with emergent situation and almost dont need the reaction time that human take in face of emergencies. From article 3 we can see on the one hand, when cars pull over or over- take, they may have trouble recognizing lane markers especially in low light, bad weather, on curves, and at forks and merging lanes. On the other hand, lane change prediction of self-driving cars may not be accurate enough, and the time it will take for a complete turnover of all cars to self-driving cars makes planning for it more than a little premature. So we reasonably assume that in our model, no lane changing situation is considered. Here is the structural difference between self-driving, cooperating cars and non-self-driving cars. Team # 55583Page 4 of 24 (a) non-self-driving car(b) self-driving car Figure 1: The difference between self-driving and non-self-driving cars in face of emergency situations Defi nition 1. Safe interval is the shortest distance from the former car to guarantee the safety, considering the current speed and response time of a human driver. And we can compute it as follows: safe interval = vins tresponse(4) When two cars distance is less than the safe interval, drivers will slow down and keep distance with the former car, which is just as the Figure 1(a) showed above. But for self-driving cooperating cars, they are controlled by artifi cial intel- ligence system and they can always react in time when the speed of the former car changes. So these cars donnot need to keep safe interval and they can just follow the former car at best, which is shown in Figure 1(b) above. 3.2The mixed, dynamic road model In order to better reproduce the dynamic road traffi c fl ow model, we choose Cellular Automaton to simulate the Real-Time Traffi c of every road section. The following Figure2 shows the improved Cellular Automaton model used in our paper. We update the model data every second. Every line in the CA represents a lane on the road. Every volume block represent a unit length to represent the length of a car and the distance between adjacent cars. As shown in Figure 2, the yellow-colored blocks represents the self-driving cars and the blue-colored blocks represent the non-self-driving cars. The following list contains all the pa- rameters and procedures in our CA based road model. Unit length lu: For convenience, the unit length lu= 4m, equals the length of a regular car. Lanes count nl: Because the two directions on each road have no distinct difference, and will not disrupt each other as well. So we regard them the Team # 55583Page 5 of 24 Figure 2: The Cellular Automaton based road model same in our model, and the lanes number is the addition of lane counts of these two directions. nl= nleft+ nright(5) Adjacent cars distance d: we defi ne the number of unit length between two cars the distance from the rear end of the fi rst car to the head of next car, namely. d = posformer poslatter 1(6) Road section length LR: For every section of the road, the length of this section is the number of unit length. LR= Lreal lu (7) Maximum speed Vmax : we defi ne the speed by how many unit lengths the car has gone per second.Speed limit is 60 mile/h, which is about 27 m/s, namely, 7 unit length per second.Vmax= 7 units/s Human response time tresponse : we defi ne human response time as the time which a person need to start to slow down the car after he or she has found emergency. Commonly, response time is from 0.3 seconds to 1.5 sec- onds.Here we defi ne tresponse= 1 Instantaneous velocity of cars vins: The instantaneous speed of this corre- sponding car decides how many blocks the car will move forward at next second. And the unit of vinsis blocks per second Traffi c Counts TC: During some time, the amount of the cars reaching the end of road section is the TC of this road section during that long time. Team # 55583Page 6 of 24 3.3Performance evaluation criteria 3.3.1Car Velocity v From the model above, the instantaneous speed is easily accessible, but the car velocity we use to evaluate the road condition is the average velocity of cars that passed the road during certain time slot. The average car velocity can well refl ect the road performance under different conditions. The bigger the velocity is, the lesscrowdedtheroad isandthus the better the road capacity is. From our model, there is a trick to get the average car velocity: First, we count all the cars every second on the roads and sum them up. Nsum= tn(per second)(8) Then, the average car passing time is accessible. tavg= Nsum TC (9) v = Lreal tavg (10) 3.3.2Daily Equilibria 1 2 t , 1 2 s We evaluated the traffi c network equilibria from both time aspect and space as- pect. On the one hand, for a certain road section, during a single day, including peak hours and average hours, if the car velocity keeps stable and changes little, the time daily equilibria of the traffi c network is obviously better. Defi nition 2. Time daily equilibria.We defi ne it as 1 2 t ,where 2 t is the car velocity variance during different period in a day for a certain road section. 2 t = 1 mm(vti v)2(11) On the other hand, at specifi c time slot, if the car velocities of different road sections do not distinct too much or nearly same, the space daily equilibria of the traffi c network is much better. Defi nition 3. Space daily equilibria.We defi ne it as 1 2 s ,where 2 s as the car velocity variance at same time among different road sections. In this problem, the road sections of the particularly concerned four roads is 224. 2 s = 1 224(vli v)2(12) Team # 55583Page 7 of 24 4Model Extension and Simulation Analysis We decomposed our simulation into three steps and
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2025年医院智能化安防系统升级改造与维护服务合同
- 2025年专业酒店厨房设备深度清洗与保养服务协议
- 2025年度新型环保针纺织品加工与批发代理合同范本
- 2025年乡村小学食堂设备采购与全面维护服务合同
- 内瘘题目及答案
- 南京电工电路考试试题及答案
- 木僵题库及答案
- 2025年农业产业集群农业产业园区产业园区农业科技园区人才引进与培养机制研究报告
- 3财富管理行业2025年高净值客户财富管理需求与市场调研报告
- 迪信通梅州店5月17日国际电信日店面促销活动方案
- 国家电网公司供电企业劳动定员标准
- 7-聊城东制梁场80t龙门吊安拆安全专项方案-八局一-新建郑州至济南铁路(山东段)工程ZJTLSG-2标段
- 证据目录范本
- 中兴 ZXNOE 9700 系统介绍
- GB/T 21475-2008造船指示灯颜色
- 有理数加减混合运算练习题300道-
- 园林绿化工高级技师知识考试题库(附含答案)
- 安医大生殖医学课件04胚胎的培养
- 提高肠镜患者肠道准备合格率课件
- 灭火器每月定期检查及记录(卡)表
- 关于推荐评审高级工程师专业技术职务的推荐意见报告
评论
0/150
提交评论