Computer Science ›› 2020, Vol. 47 ›› Issue (6A): 34-39.doi: 10.11896/JsJkx.191100191

• Artificial Intelligence • Previous Articles     Next Articles

Traffic Strategy in Dense Crowd Environments Based on Expandable Path

GAO Qing-Ji, WANG Wen-bo, HOU Shi-hao and XING Zhi-wei   

  1. Institute of Robotics,Civil Aviation University of China,TianJin 300300,China
  • Published:2020-07-07
  • About author:GAO Qing-Ji, born in 1966, ph.D, professor.His main research interests include artificial intelligence and intelligent robot.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (U1533203) and Fundamental Research Funds for the Central Universities of Ministry of Education of China (3122019043).

Abstract: Safe and efficient traffic in dense crowd environments is an important issue to be solved for robots in applications such as airport terminals,etc.The difficulty lies in adapting to the uncertainty of pedestrian behavior and the variability of feasible paths.Referring the social force model of passage and avoidance in crowds,this paper proposed the path expandable view and the traffic strategy in dense crowd environments.Firstly,this paper built the expandable path model,analyzed the space-time relationship between pedestrians and robots,and extracted the expandable path with the path passage probability and credibility.Secondly,the distance convex hull method to select the expandable path set was proposed.On this basis,Breadth First Search was used to establish expandable path set and remove redundant paths.Finally,this paper formulated the traffic strategy of robots in various environments according to the optimal path evaluation function and the right of way rule.Simulation results show that the method can achieve higher traffic efficiency in dense crowd environments.

Key words: Dense crowd, Expandable path, Passage probability, Credibility, Traffic strategy

CLC Number: 

  • TP242
[1] GAO S,XU F Z,GUO H J.Research on mobile robots’ path planning based on a spring model.Chinese Journal of Scientific Instrument,2016,37(4):796-803.
[2] ROSTAMI S M H,SANGAIAH A K,WANG J,et al.Obstacle avoidance of mobile robots using modified artificial potential field algorithm..https://doi.org/10.1186/s13638-019-1396-2.
[3] SEDER M,PETROVIC I.Dynamic window based approach to mobile robot motion control in the presence of moving obstacles//IEEE International Conference on Robotics and Automation.Roma,Italy:IEEE Press,2007:1986-1992.
[4] SARANRITTICHAI P,NIPARNAN N,SUDSANG A.Robust local obstacle avoidance for mobile robot based on Dynamic Window approach//Proceeding of 10th International Conference on Electrical Engineering/Electronics,Computer,Telecommunication and Information Technology (EC-TI-CON).2013:1-4.
[5] ZHOU Y,CHEN B.Method for robot obstacle avoidance based on the improve dueling network.Journal of Xidian University,2019,46(1):46-50,63.
[6] ZHANG W,MA Y,ZHAO H D,et al.Obstacle avoidance path planning of intelligent mobile based on improved fireworks-ant colony hybrid algorithm.Control and Decision,2019,34(2):335-343.
[7] NI T,WEI D R,ZHAO X L,et al.Neural Dynamic Collision-Avoidance Strategy for Robots Based on Evaluation of Threat Degree.Robot,2017,39(6):853-859.
[8] CHEN T D,HUANG Y Y,ZHANG Y L.Non-trap dynamic path planning based on collision risk.Systems Engineering and Electronics,2019,41(11):2496-2506.
[9] ZHANG Yu-qin,born in 1977,master,lecture.Her main research interests include optimization theory and algorithm.
[1] QI R L,ZHOU W J,LIU J G,et al.Obstacle Avoidance TraJectory Planning for Gaussian Motion of Robot Based on Probability Theory.Journal of Mechanical Engineering,2017,53(5):93-100.
[2] CHEN Y,PENG H,GRIZZLE J.Obstacle Avoidance for Low-Speed Autonomous Vehicles With Barrier Function.IEEE Transactions on Control Systems Technology,2018,26(1):194-206.
[3] MALONE N,CHIANG H T,LESSER K,et al.Hybrid Dynamic Moving Obstacle Avoidance Using a Stochastic Reachable Set-Based Potential Field.IEEE Transactions on Robotics,2017,33(5):1124-1138.
[4] LIEBOWITZ B.Human Territories:How We Behave in Space-Time.Family Process,2004,15(4):447-451.
[5] LANG P J,BRADLEY M M,CUTHBERT B N.Emotion,attention,and the startle reflex.Psychological Review,1990,97(3):377-395.
[6] ELLIOT A J.The Hierarchical Model of Approach-Avoidance Motivation.Motivation and Emotion,2006,30(2):111-116.
[7] ALEXOPOULOS T,RIC F.The evaluation-behavior link:Direct and beyond valence.Journal of Experimental SocialPsycho-logy,2007,43(6):1010-1016.
[8] ZHANG X W,XUAN Y M,FU X L.The Effect of Emotional Valences on Approach and Avoidance Responses.Advances in Psychological Science,2012,20(7):1023-1030.
[9] ZHENG J,LIU L,SHI J X,et al.The Definition,Theory and Research Paradigm of The Compatibility Effect.Advances in Psychological Science,2013,21(9):1686-1695.
[10] HELBING D,MOLNAR P.Social Force Model for Pedestrian Dynamics.Physical review.E,Statistical physics,plasmas,fluids,and related interdisciplinary topics,1998,51(5):4282.
[11] HELBING D,FARKAS I J,VICSEK T.Simulating Dynamical Features of Escape Panic.Social Science Electronic Publi-shing,2000,407(6803):487-490.
[12] ZANLUNGO F,IKEDA T,KANDA T.Social force model with explicit collision prediction.EPL (Europhysics Letters),2011,93(6):68005.
[13] YU H,WANG Y,ZHANG X,et al.Extended Social Force Model-Based Mean Shift for Pedestrian Tracking Under Obstacle Avoidance.IET Computer Vision,2017,11(1):1-9.
[14] JOHANSSON F,PETERSON A,TAPANI A.Waiting pedestrians in the social force model.Physica A:Statistical Mechanics and its Applications,2015,419:95-107.
[1] GUO Cong-rui, WANG Jun and FENG Yi-ming. Research on Method of Credibility Evaluation of System Simulation [J]. Computer Science, 2020, 47(6A): 567-571.
[2] YANG Xiao-jun, XU Zhong-fu, ZHANG Xing, SUN Dan-hui. Overview and Difficulties Analysis on Credibility Assessment of Simulation Models [J]. Computer Science, 2019, 46(6A): 23-29.
[3] ZHENG Hong-liang, HOU Xue-hui, SONG Xiao-ying, PANG Kuo, ZOU Li. Approach for Knowledge Reasoning Based on Hesitate Fuzzy Credibility [J]. Computer Science, 2019, 46(1): 131-137.
[4] GAO Peng, LIU Yun-jiang, GAO Wei-ting, LI Man, CHEN Juan. Double Thresholds DMM Cooperative Spectrum Sensing Algorithm Based on Credibility [J]. Computer Science, 2018, 45(9): 166-170.
[5] FENG Lei, JI Jun-zhong, WU Chen-sheng. New Method for Ranking Scientific Publications with Creditworthiness Mechanism [J]. Computer Science, 2018, 45(11A): 132-137.
[6] WU Wei-min, CHEN Dong-xin, LAI Wen-xin and SU Qing. Research and Implementation of EFI OS Loader Security Reinforcement Technology [J]. Computer Science, 2016, 43(9): 188-191.
[7] ZHANG Xue-ming, HUANG Zhi-qiu and SUN Yi. Research on Privacy Access Control Based on RBAC [J]. Computer Science, 2016, 43(1): 166-171.
[8] HE Xiao-xia and TAN Liang. Web Service Discovery Model of Semantic and Trust QoS Based on Hadoop [J]. Computer Science, 2015, 42(8): 220-224.
[9] . Study on the Application of Evidence Theory in Software Requirements Engineering [J]. Computer Science, 2012, 39(Z11): 237-239.
[10] . Code Execution Security Mechanism for Open Cloud&Client Computing [J]. Computer Science, 2012, 39(7): 7-10.
[11] . Logical Framework for Evaluation of Multiple-premise [J]. Computer Science, 2012, 39(3): 236-243.
[12] JIA Jia,ZHOU Yi,DONG Hui,ZHENG Cheng-yan. Research on Hierarchical Trusted Platform Based on Trusted Terminal [J]. Computer Science, 2011, 38(Z10): 109-113.
[13] HU Jian-li. ZHOU Bin, ZHOU Yu, WU Quan-yuan. Incentive Compatible Reputation Model for P2P Networks [J]. Computer Science, 2011, 38(9): 59-63.
[14] GNU Xue-wen,NIU Wen-sheng,MA Jian-feng,SHENU Li-jie. Security Extension on Strand Space Model for Ad-hoc Routing Protocols [J]. Computer Science, 2011, 38(7): 51-54.
[15] ZHAO Xin-Yu ,EIN Zuo-Quan (Department of Information Science, Peking University, Beijing 100871). [J]. Computer Science, 2006, 33(6): 150-153.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .