检索结果-内蒙古大学图书馆

Incentive Based Multi-Objective Optimization in Electric Vehicle Navigation including Battery Charging

IFAC Proceedings Volumes 2014年第3期47卷 6332-6337页

作者： Tomohisa Hayakawa Kyohei Ishikawa Jun-ichi Imura Hideaki Tanaka Masumi Toyoshima Akihito Iwai Tokyo Institute of Technology Tokyo Japan DENSO CORPORATION Aichi Japan DENSO International America Inc. Southfield USA

This paper proposes a framework for a navigation system of electric vehicles (EVs) that minimizes the expectation of the energy consumption of the entire users while enhancing the Quality of Life (QoL), i.e., reducing the travel time and cost in our context, of individual users. To this end, we provide users optional flexibility of selecting a preferable route based on the individual travel time and cost among the multiple candidates indicated by the system, while use an incentive approach to make users select a route that requires as low energy consumption as possible. We show by numerical simulations on Chukyo Area in Japan that the proposed method is effective.

关键词： Electric vehicles Incentive Smart charge Navigation Quality of Life dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Path Planning Method Using the Experience of Taxi Drivers

引用

Procedia - Social and Behavioral Sciences 2013年 96卷 1898-1909页

作者： Hu Ji-hua Huang Ze Deng Jun Research Center of Intelligent Transportation System Sun Yat-sen University Guangzhou 510006 China Guangdong Provincial Key Laboratory of Intelligent Transportation System Guangzhou 510006 China

Effective path planning has been identified as an important requirement for route navigation in Intelligent Transportation Systems (ITS). However, the paths computed by the conventional path planning algorithms are usually not optimal because they ignore the drivers’ experience and the characteristics of the local road network. Routes chosen by taxi drivers are believed to be more representative, so it can be significant to take advantage of the taxi drivers’ experience to support the path planning. We present a hierarchical path planning method based on the experiential routes of taxis. The algorithm consists of three steps. Firstly, routes are extracted from original taxi trajectories. Secondly, all roads are categorized according to the track data and then the road network is classified into two grades using travel frequency for road segments. Thirdly, combined with dijkstra algorithm, a hierarchical path planning method which searches paths by traversing the hierarchy is proposed. Guangzhou, China is chosen for the study because of the availability of taxi GPS data. This study compares the paths planned by the proposed approach with the conventional algorithm's results from the aspects such as travel time and route length. The experimental results show that the method proposed incurs much lower costs in travel time than the traditional ITS path planning using dijkstra or hierarchical dijkstra algorithms.

关键词： Intelligent Transportation Systems path planning dijkstra algorithm experiential routes of taxi hierarchical road network

来源：评论

学校读者我要写书评

暂无评论

Optimization of a Route Network in Dakar Airspace: Surface Navigation

引用

American Journal of Operations Research 2022年第2期12卷 64-81页

作者： Mint Elhassen Emani Amadou Coulibaly Salimata G. Diagne Ahmedou Ould Haouba Alain Ngoma Mby Cheikh Anta Diop University Dakar Senegal University of Nouakchott AL Aasriya Nouakchott Mauritanie Agency for Aerial Navigation Safety in Africa and Madagascar Dakar Senegal

In this paper, the map of a network of air routes was updated by removing the non-optimal routes and replacing them with the best ones. An integer linear programming model was developed. The aim was to find optimal routes in superspace based on performance-based navigation. The optimal routes were found from a dijkstra algorithm that calculates the shortest path in a graph. Simulations with python language on real traffic areas showed the improvements brought by surface navigation. In this work, the conceptual phase and the upper airspace were studied.

关键词： Airspace Linear Optimization Graph Theory dijkstra algorithm Performance-Based Navigation Conventional Navigation

来源：评论

学校读者我要写书评

暂无评论

Path Planning algorithms for Smart Parking: Review and Prospects

引用

WORLD ELECTRIC VEHICLE JOURNAL 2024年第7期15卷 322页

作者： Han, Zhonghai Sun, Haotian Huang, Junfu Xu, Jiejie Tang, Yu Liu, Xintian China Automot Engn Res Inst Co Ltd Chongqing 401122 Peoples R China Shanghai Univ Engn Sci Sch Mech & Automot Engn Shanghai 201620 Peoples R China Shanghai Smart Vehicle Cooperat Innovat Ctr Shanghai 201805 Peoples R China

Path planning algorithms are crucial components in the process of smart parking. At present, there are many path planning algorithms designed for smart parking. A well-designed path planning algorithm has a significant impact on the efficiency of smart parking. Firstly, this paper comprehensively describes the principles and steps of four types of path planning algorithms: the dijkstra algorithm (including its optimized derivatives), the A* algorithm (including its optimized derivatives), the RRT (Rapidly exploring Random Trees) algorithm (including its optimized derivatives), and the BFS (Breadth First Search) algorithm. Secondly, the dijkstra algorithm, the A* algorithm, the BFS algorithm, and the Dynamic Weighted A* algorithm were utilized to plan the paths required for the process of smart parking. During the analysis, it was found that the dijkstra algorithm had the drawbacks of planning circuitous paths and taking too much time in the path planning for smart parking. Although the traditional A* algorithm based on the dijkstra algorithm had greatly reduced the planning time, the effect of path planning was still unsatisfactory. The BFS (Breadth First Search) algorithm had the shortest planning time among the four algorithms, but the paths it plans were unstable and not optimal. The Dynamic Weighted A* algorithm could achieve better path planning results, and with adjustments to the weight values, this algorithm had excellent adaptability. This review provides a reference for further research on path planning algorithms in the process of smart parking.

关键词： dijkstra algorithm A* algorithm BFS algorithm RRT algorithm smart parking Dynamic Weighted A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Autonomous indoor wayfinding for individuals with cognitive impairments

引用

JOURNAL OF NEUROENGINEERING AND REHABILITATION 2010年第1期7卷 45-45页

作者： Chang, Yao-Jen Peng, Shu-Ming Wang, Tsen-Yung Chen, Shu-Fang Chen, Yan-Ru Chen, Hung-Chi Chung Yuan Christian Univ Dept Elect Engn Jhongli Taiwan Taipei Municipal Jen Ai Hosp Ctr Occupat Therapy Taipei Taiwan

Background: A challenge to individuals with cognitive impairments in wayfinding is how to remain oriented, recall routines, and travel in unfamiliar areas in a way relying on limited cognitive capacity. While people without disabilities often use maps or written directions as navigation tools or for remaining oriented, this cognitively-impaired population is very sensitive to issues of abstraction (e.g. icons on maps or signage) and presents the designer with a challenge to tailor navigation information specific to each user and context. Methods: This paper describes an approach to providing distributed cognition support of travel guidance for persons with cognitive disabilities. A solution is proposed based on passive near-field RFID tags and scanning PDAs. A prototype is built and tested in field experiments with real subjects. The unique strength of the system is the ability to provide unique-to-the-user prompts that are triggered by context. The key to the approach is to spread the context awareness across the system, with the context being flagged by the RFID tags and the appropriate response being evoked by displaying the appropriate path guidance images indexed by the intersection of specific end-user and context ID embedded in RFID tags. Results: We found that passive RFIDs generally served as good context for triggering navigation prompts, although individual differences in effectiveness varied. The results of controlled experiments provided more evidence with regard to applicabilities of the proposed autonomous indoor wayfinding method. Conclusions: Our findings suggest that the ability to adapt indoor wayfinding devices for appropriate timing of directions and standing orientation will be particularly important.

关键词： Decision Point Cognitive Disability dijkstra algorithm Indoor Navigation Alternate Treatment Design

来源：评论

学校读者我要写书评

暂无评论

An algorithm to Find K Shortest Path

引用

International English Education Research 2014年第10期 54-57页

作者： Gangming Sun Pin Wang Department of Mathematics and Computer Science Guangxi College of Education Guangxi Nannmg China 530023

In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.

关键词： Branch and Bound Shortest Path dijkstra algorithm Fibonacei Heap

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving Outsourcing algorithm for Finding the Shortest Path of Non-negative Weight Graphs

International Core Journal of Engineering

引用

International Core Journal of Engineering 2022年第3期8卷 562-576页

作者： Zhequn Zhao Hanlin Zhang Chi Zhang Jie Lin Jin Guo Yalong Wu

The shortest path algorithms are the basic algorithms in graph theory and have been widely used in various fields, such as social network analysis, network routing, geographical navigation, etc. In a graph model, people/objects can be abstracted as a vertex, and the relationships among the people/objects can be regarded as edges to connect vertices to form a graph. As the population grows, the relationship between entities becomes more complicated, and the graph becomes larger. Many resource-constrained devices cannot afford such a huge amount of calculation. How to effectively solve this problem becomes a challenging issue. To solve this problem, this paper proposes a secure outsourcing algorithm that allows resource-constrained devices to outsource the shortest path computing tasks to a single cloud server. In this process, we ensure the privacy of input and output. Meanwhile, the misbehaviors of cloud servers can be detected by the outsourcer with a probability close to 1. This paper eventually verifies the algorithm as being secure and correct by relevant theory and experiments.

关键词： Cloud Computing Secure Outsourcing Privacy Shortest Path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

AGV Scheduling Optimization of Automated Port Based on Disruption Management

引用

Journal of Transportation Technologies 2024年第3期14卷 423-444页

作者： Ching-Kuei Kao Qi-Er Ke King-Zoo Tang Peng-Jung Lin Key Laboratory of LNG Industry Chain Fujian University of Technology Fuzhou China Department of Logistics Management Fujian University of Technology Fuzhou China Department of Information Management Taiwan Chung Cheng University Chiayi Metaverse and New Media College Yango University Fuzhou China

The recent rapid development of China’s foreign trade has led to the significant increase in waterway transportation and automated container ports. Automated terminals can significantly improve the loading and unloading efficiency of container terminals. These terminals can also increase the port’s transportation volume while ensuring the quality of cargo loading and unloading, which has become an inevitable trend in the future development of ports. However, the continuous growth of the port’s transportation volume has increased the horizontal transportation pressure on the automated terminal, and the problems of route conflicts and road locks faced by automated guided vehicles (AGV) have become increasingly prominent. Accordingly, this work takes Xiamen Yuanhai automated container terminal as an example. This work focuses on analyzing the interference problem of path conflict in its horizontal transportation AGV scheduling. Results show that path conflict, the most prominent interference factor, will cause AGV scheduling to be unable to execute the original plan. Consequently, the disruption management was used to establish a disturbance recovery model, and the dijkstra algorithm for combining with time windows is adopted to plan a conflict-free path. Based on the comparison with the rescheduling method, the research obtains that the deviation of the transportation path and the deviation degree of the transportation path under the disruption management method are much lower than those of the rescheduling method. The transportation path deviation degree of the disruption management method is only 5.56%. Meanwhile, the deviation degree of the transportation path under the rescheduling method is 44.44%.

关键词： Automated Port Disruption Management Automated Guided Vehicle Scheduling dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

An Approximation algorithm for the Minimum Vertex Cover Problem

引用

Procedia Engineering 2016年 137卷 180-185页

作者： Jingrong Chen Lei Kou Xiaochuan Cui School of Mathematics and Physics Lanzhou Jiaotong University Lanzhou 730070 P. R. China

The minimum vertex cover problem is a basic combinatorial optimization problem. Given an undirected graph the objective is to determine a subset of the vertices which covers all edges such that the number of the vertices in the subset is minimized. In the paper, based on dijkstra algorithm, an approximation algorithm is obtained for the minimum vertex cover problem. In the process of getting a vertex cover, the maximum value of shortest paths is considered as a standard, and some criteria are defined. The time complex of the algorithm is O ( n 3) where n is the number of vertices in a graph. In the end, an example is given to illustrate the process and the validity of the algorithm.

关键词： minimum vertex cover problem dijkstra algorithm approximation algorithm time complexity

来源：评论

学校读者我要写书评

暂无评论

Fluid Flow Concentration on Preferential Paths in Heterogeneous Porous Media: Application of Graph Theory

引用

JOURNAL OF GEOPHYSICAL RESEARCH-SOLID EARTH 2021年第12期126卷 e2021JB023164-e2021JB023164页

作者： Tang, Y. B. Zhao, J. Z. Bernabe, Y. Li, M. Southwest Petr Univ State Key Lab Oil & Gas Reservoir Geol & Exploita Chengdu Peoples R China MIT Dept Earth Atmospher & Planetary Sci Cambridge MA 02139 USA

Fluid flow through geological formations is often concentrated on distinct preferential flow paths owing to the presence of fractures or large-scale permeability structures. However, the existence of such structures is not a mandatory condition of preferential paths formation. Pore-scale spatial fluctuations of pore size and/or pore connectivity in statistically stationary porous media, if sufficiently large, can also lead to the concentration of fluid flow on distinct pathways. In this paper, we attempted to establish the conditions of formation of preferential flow paths in heterogeneous porous media in terms of pore-size heterogeneity and pore connectivity. We simulated steady-state flow through stochastically constructed two- and threedimensional pore networks, in which the width of the pore radius distribution and the pore coordination number (a measure of pore connectivity) were varied. We developed new techniques based on graph theory to identify potential preferential flow paths and characterize them. We observed a gradual transition from approximately uniform flow fields in low heterogeneity/high connectivity networks to flow localization on preferential paths with increasing pore-size heterogeneity and decreasing connectivity. The transition occurred at lower heterogeneity levels in three-dimensional than in two-dimensional simulations and was less influenced by pore connectivity variations. These results were summarized in a phase diagram in pore-size heterogeneity/pore connectivity parameter space, which we found consistent with relevant real rocks data. Plain Language Summary In general, fluid flow underground is unevenly distributed. Most of the flow occurs in distinct channels called preferential flow paths, which are often associated with large-scale structures such as highly permeable layers or fractures. Preferential flow paths can also form in rock formations in which such features are absent. The only requirements are a sufficiently high level of

关键词： fluid flow heterogeneous porous media pore connectivity preferential flow paths directed graphs dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：