Einloggen

Thematische Bibliographien / Avoidance algorithms

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Avoidance algorithms“

Autor: Grafiati

Veröffentlicht am 25. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Avoidance algorithms" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Avoidance algorithms"

1

N. Abdulnabi, Ali. „Obstacle Avoidance Techniques for Robot Path Planning“. DJES 12, Nr. 1 (01.03.2019): 56–65. http://dx.doi.org/10.24237/djes.2019.12107.

Der volle Inhalt der Quelle

Annotation:

This paper presents a collision-free path planning approaches based on Bézier curve and A-star algorithm for robot manipulator system. The main problem of this work is to finding a feasible collision path planning from initial point to final point to transport the robot arm from the preliminary to the very last within the presence of obstacles, a sequence of joint angles alongside the path have to be determined. To solve this problem several algorithms have been presented among which it can be mention such as Bug algorithms, A-Star algorithms, potential field algorithms, Bézier curve algorithm and intelligent algorithms. In this paper obstacle avoidance algorithms were proposed Bézier and A-Star algorithms, through theoretical studies and simulations with several different cases, it's found verify the effectiveness of the methods suggested. It's founded the Bézier algorithm is smoothing accurate, and effective as compare with the A-star algorithm, but A-star is near to shortest and optimal path to free collision avoidance. The time taken and the elapsed time to traverse from its starting position and to reach the goal are recorded the tabulated results show that the elapsed time with different cases to traverse from the start location to destination using A-star Algorithm is much less as compared to the time taken by the robot using Bézier Algorithm to trace the same path. The robot used was the Lab-Volt of 5DOF Servo Robot System Model 5250 (RoboCIM5250)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Zhou, Bin, und Jin Fa Qian. „Obstacle Avoidance Control Method of Mobile Robot Motion“. Applied Mechanics and Materials 443 (Oktober 2013): 119–22. http://dx.doi.org/10.4028/www.scientific.net/amm.443.119.

Der volle Inhalt der Quelle

Annotation:

Mobile robot is an intelligent system which can move freely and is scheduled to complete the task in the working environment. Obstacle avoidance of mobile robot is the research hotspot in the control field of the mobile robot. The mobile robot obstacle avoidance methods are classified, including the traditional algorithms and the intelligent algorithms. This paper summarizes the intelligent algorithm in the mobile robot obstacle avoidance technique in the present situation, and the intelligent algorithm which is the most researched in the current. Finally, this paper prospects the development trend of intelligent obstacle avoidance of the robot.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Abhishek, Talabattula Sai, Daniel Schilberg und Arockia Selvakumar Arockia Doss. „Obstacle Avoidance Algorithms: A Review“. IOP Conference Series: Materials Science and Engineering 1012 (08.01.2021): 012052. http://dx.doi.org/10.1088/1757-899x/1012/1/012052.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Abhishek, Talabattula Sai, Daniel Schilberg und Arockia Selvakumar Arockia Doss. „Obstacle Avoidance Algorithms: A Review“. IOP Conference Series: Materials Science and Engineering 1012 (08.01.2021): 012052. http://dx.doi.org/10.1088/1757-899x/1012/1/012052.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Gal, Oren. „Unified Trajectory Planning Algorithms for Autonomous Underwater Vehicle Navigation“. ISRN Robotics 2013 (09.06.2013): 1–6. http://dx.doi.org/10.5402/2013/329591.

Der volle Inhalt der Quelle

Annotation:

This paper presents two efficient methods for obstacle avoidance and path planning for Autonomous Underwater Vehicle (AUV). These methods take into account the dynamic constraints of the vehicle using advanced simulator of AUV considering low level control and stability effects. We present modified visibility graph local avoidance method and a spiral algorithm for obstacle avoidance. The algorithms were tested in challenged scenarios demonstrating safe trajectory planning.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Kadry, Seifedine, Gennady Alferov und Viktor Fedorov. „D-Star Algorithm Modification“. International Journal of Online and Biomedical Engineering (iJOE) 16, Nr. 08 (17.07.2020): 108. http://dx.doi.org/10.3991/ijoe.v16i08.14243.

Der volle Inhalt der Quelle

Annotation:

One of the most effective methods for solving a navigation problem is the method of constructing a navigation system based on the simultaneous localization and mapping algorithm and obstacle avoidance algorithms. One of the most effective obstacles avoidance algorithms is the D-star algorithm [1, 2, 3], which, despite its effectiveness, has some drawbacks. This modification allows to eliminate some problems arising during the implementation of the navigation system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Xu, Zhao, Jinwen Hu, Yunhong Ma, Man Wang und Chunhui Zhao. „A Study on Path Planning Algorithms of UAV Collision Avoidance“. Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 37, Nr. 1 (Februar 2019): 100–106. http://dx.doi.org/10.1051/jnwpu/20193710100.

Der volle Inhalt der Quelle

Annotation:

The unmanned aerial vehicle (UAV) has been a research hotspot worldwide. The UAV system is developing to be more and more intelligent and autonomous. UAV path planning is an important part of UAV autonomous control and the important guarantee of UAV's safety. For the purpose of improving the collision avoidance and path planning algorithms, the artificial potential field, fuzzy logic algorithm and ant colony algorithm are simulated respectively in the static obstacle and dynamic obstacle environments, and compared based on the minimum avoidance distance and range ratio. Meanwhile, an improved algorithm of artificial potential field is proposed, and the improvement helps the UAV escape the local minimum by introducing the vertical guidance repulsion. The simulation results are rigorous and reliable, which lay a foundation for the further fusion of multiple algorithms and improving the path planning algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Li, Juan, Jianxin Zhang, Honghan Zhang und Zheping Yan. „A Predictive Guidance Obstacle Avoidance Algorithm for AUV in Unknown Environments“. Sensors 19, Nr. 13 (27.06.2019): 2862. http://dx.doi.org/10.3390/s19132862.

Der volle Inhalt der Quelle

Annotation:

A predictive guidance obstacle avoidance algorithm (PGOA) in unknown environments is proposed for autonomous underwater vehicle (AUV) that must adapt to multiple complex obstacle environments. Using the environmental information collected by the Forward-looking Sonar (FLS), the obstacle boundary is simplified by the convex algorithm and Bessel interpolation. Combining the predictive control secondary optimization function and the obstacle avoidance weight function, the predicting obstacle avoidance trajectory parameters are obtained. According to different types of obstacle environments, the corresponding obstacle avoidance rules are formulated. Lastly, combining with the obstacle avoidance parameters and rules, the AUV’s predicting obstacle avoidance trajectory point is obtained. Then AUV can successfully achieve obstacle avoidance using the guidance algorithm. The simulation results show that the PGOA algorithm can better predict the trajectory point of the obstacle avoidance path of AUV, and the secondary optimization function can successfully achieve collision avoidance for different complex obstacle environments. Lastly, comparing the execution efficiency and cost of different algorithms, which deal with various complex obstacle environments, simulation experiment results indicate the high efficiency and great adaptability of the proposed algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Hou, Yew Cheong, Khairul Salleh Mohamed Sahari, Leong Yeng Weng, Hong Kah Foo, Nur Aira Abd Rahman, Nurul Anis Atikah und Raad Z. Homod. „Development of collision avoidance system for multiple autonomous mobile robots“. International Journal of Advanced Robotic Systems 17, Nr. 4 (01.07.2020): 172988142092396. http://dx.doi.org/10.1177/1729881420923967.

Der volle Inhalt der Quelle

Annotation:

This article presents a collision avoidance system for multiple robots based on the current autonomous car collision avoidance system. The purpose of the system is to improve the current autonomous car collision avoidance system by including data input of other vehicles’ velocity and positioning via vehicle-to-vehicle communication into the current autonomous car collision avoidance system. There are two TurtleBots used in experimental testing. TurtleBot is used as the robot agent while Google Lightweight Communication and Marshalling is used for inter-robot communication. Additionally, Gazebo software is used to run the simulation. There are two types of collision avoidance system algorithm (collision avoidance system without inter-robot communication and collision avoidance system with inter-robot communication) that are developed and tested in two main road crash scenarios, rear end collision scenario and junction crossing intersection collision scenario. Both algorithms are tested and run both in simulation and experiment setup, each with 10 repetitions for Lead TurtleBot sudden stop, Lead TurtleBot decelerate, Lead TurtleBot slower speed, and straight crossing path conditions. Simulation and experimental results data for each algorithm are recorded and tabulated. A comprehensive comparison of performance between the proposed algorithms is analyzed. The results showed that the proposed system is able to prevent collision between vehicles with an acceptable success rate.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Li, Jinxin, Hongbo Wang, Wei Zhao und Yuanyuan Xue. „Ship’s Trajectory Planning Based on Improved Multiobjective Algorithm for Collision Avoidance“. Journal of Advanced Transportation 2019 (09.04.2019): 1–12. http://dx.doi.org/10.1155/2019/4068783.

Der volle Inhalt der Quelle

Annotation:

With vigorous development of the maritime trade, many intelligent algorithms have been proposed to avoid collisions due to resulting casualties and increased costs. According to the international regulations for preventing collisions at sea (COLREGs) and the self-evolution ability of the intelligent algorithm, the collision avoidance trajectory can be more consistent with the requirements of reality and maritime personnel. In this paper, the optimization of ship collision avoidance strategies is realized by both an improved multiobjective optimization algorithm NSGA-II and the ship domain under the condition of a wide sea area without any external disturbances. By balancing the safety and economy of ship collision avoidance, the avoidance angle and the time to the action point are used as the variables encoded by the algorithm, and the fuzzy ship domain is used to calculate the collision avoidance risk to achieve collision avoidance. The simulation results show that the proposed method can optimize the ship collision avoidance strategy and provide a reasonable scheme for ship navigation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Avoidance algorithms"

1

Zhang, Wenle. „Scalable deadlock avoidance algorithms for flexible manufacturing systems“. Ohio : Ohio University, 2000. http://www.ohiolink.edu/etd/view.cgi?ohiou1179862449.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Chua, Kee Koon 1965. „Deadlock avoidance: Improved algorithms for centralized and distributed systems“. Thesis, The University of Arizona, 1992. http://hdl.handle.net/10150/291335.

Der volle Inhalt der Quelle

Annotation:

A deadlock avoidance algorithm for a centralized resource allocation system is presented. Unlike the Banker's algorithm, this proposed algorithm makes use of the state of the previous safe sequence to construct a new safe sequence. The performance of this proposed algorithm is compared to that of both the Banker's algorithm and an efficient algorithm proposed by Belik. The simulation results show that our algorithm's execution time is significantly better than the Banker's algorithm and is very competitive with Belik's algorithm. In addition, our Modified Banker's Algorithm produces optimal results unlike Belik's approach which sometimes deems a safe allocation request unsafe. This centralized algorithm combined with an algorithm by Moser, is extended for use in distributed systems. Compared with Moser's algorithm, this algorithm is less restrictive in acquiring resources from other processes and allowing increase in its maximum resource requirement as confirmed by our analysis and simulation results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Liu, Xintong. „Different techniques for congestion avoidance algorithms in bottleneck networks“. Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/26961.

Der volle Inhalt der Quelle

Annotation:

In this thesis, we systematically examine the ECN (Explicit Congestion Notification) mechanism to be applied to some AQM (Active Queue Management) techniques developed in recent years, namely, RED (Random Early Detection), BLUE, ARED (Adaptive RED) and PI-RED (Proportional and Integral RED). We use packet marking as the indication of network congestion, instead of the strategy of dropping packet currently adopted by these AQM algorithms. The performance comparison of ECN-AQM with AQM has been conducted in not only a single bottleneck network but also a multi-bottleneck network environment. The simulation results have shown that ECN-AQM algorithms can greatly decrease unnecessary packet loss, one of the main shortcomings of RED and some other AQM algorithms. They can also reduce average queue size in most cases, but the queue size oscillation problem remains. We therefore investigate the application of the head dropping policy to AQM techniques, as a simple solution to the problem of queue oscillation, another shortcoming of RED and its variants. With this method, instead of tail dropping, which is currently used by RED and many other AQM schemes, the TCP source can be informed of the congestion occurring in the bottleneck router earlier by getting rid of time to wait through the queuing delay. We have compared DH-RED (Drop Head RED) and DH-BLUE (Drop Head BLUE) with the current RED and BLUE in both of the single bottleneck and the multi-bottleneck networks. We found the performance of queue size stability can be greatly improved by DH-RED and DH-BLUE.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Rushall, David Aaron 1964. „Efficient heuristics for collision avoidance in three dimensions“. Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277041.

Der volle Inhalt der Quelle

Annotation:

This thesis represents a relatively new aspect of computing with regard to robotics. The need for fast, efficient collision avoidance algorithms is growing rapidly. Because conventional methods are complex and require vast amounts of computation, heuristic algorithms are more appealing. The focus of this thesis is the problem of moving a point through three dimensional space while avoiding known polyhedral obstacles. A heuristic algorithm to find shortest (near-optimal) collision-free paths in the presence of polyhedral obstacles, given initial and final positions, is presented. Previous methods for the problem rely on an a priori discretization of the space. The points in the discretization form nodes of a graph, and the collision avoidance problem is then solved by using some shortest path algorithm on the graph. The heuristic suggested here successively adds nodes to a graph, thus keeping the size of the graph manageable. The computational results are extremely encouraging.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Conkur, Erdinc Sahin. „Real time path planning and obstacle avoidance algorithms for redundant manipulators“. Thesis, University of Bristol, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389131.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Pai, Arun S. „Development of deterministic collision-avoidance algorithms for routing automated guided vehicles /“. Online version of thesis, 2008. http://hdl.handle.net/1850/7289.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Ringdahl, Ola. „Techniques and Algorithms for Autonomous Vehicles in Forest Environment“. Licentiate thesis, Umeå : Department of Computing Science, Umeå University, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-1314.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Conrad, Jeremy (Jeremy A. ). „An educational tool to assist students in the evaluation of object avoidance algorithms“. Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36302.

Der volle Inhalt der Quelle

Annotation:

Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2006.
Includes bibliographical references (p. 21).
Autonomous robots are becoming a part of everyday life. One difficulty in the creation of autonomous robots is having the robots avoid objects. In particular once one has chosen an algorithm difficulty arises in perfecting the parameters involved. Presented here is an implementation of an algorithm and an education support tool add-on to MOOS that allows the end user to quickly vary the parameters to test the performance of the system.
by Jeremy Conrad.
S.B.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Lee, Hua. „High-Precision Geolocation Algorithms for UAV and UUV Applications in Navigation and Collision Avoidance“. International Foundation for Telemetering, 2008. http://hdl.handle.net/10150/606155.

Der volle Inhalt der Quelle

Annotation:

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California
UUV homing and docking and UAV collision avoidance are two seemingly separate research topics for different applications. Upon close examination, these two are a pair of dual problems, with interesting correspondences and commonality. In this paper, we present the theoretical analysis, signal processing, and the field experiments of these two algorithms in UAV and UUV applications in homing and docking as well as collision avoidance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Call, Brandon R. „Obstacle Avoidance for Small Unmanned Air Vehicles“. Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1556.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Avoidance algorithms"

1

Goka, Tsuyoshi. Analysis of estimation algorithms for CDTI and CAS applications. Mountain View, Calif: Analytical Mechanics Associates, Inc., 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Goka, Tsuyoshi. Analysis of estimation algorithms for CDTI and CAS applications. Mountain View, Calif: Analytical Mechanics Associates, Inc., 1985.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

G, Rojas R., Burnside Walter Dennis 1942- und United States. National Aeronautics and Space Administration., Hrsg. Modelling and performance analysis of four and eight element TCAS. Columbus, Ohio: Ohio State University, Electroscience Laboratory, 1990.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Center, Ames Research, Hrsg. Cascading a systolic array and a feedforward neural network for navigation and obstacle avoidance using potential fields. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1991.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Obstacle Avoidance in Multi-Robot Systems: Experiments in Parallel Genetic Algorithms (World Scientific Series in Robotics and Intelligent Systems , Vol 20). World Scientific Publishing Company, 1998.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Avoidance algorithms"

1

Belik, Ferenc. „A distributed deadlock avoidance technique“. In Distributed Algorithms, 144–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0019801.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Avni, Hillel, Shlomi Dolev und Eleftherios Kosmas. „Proactive Contention Avoidance“. In Transactional Memory. Foundations, Algorithms, Tools, and Applications, 228–41. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14720-8_11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Nikoletseas, Sotiris, und Olivier Powell. „Obstacle Avoidance Algorithms in Wireless Sensor Networks“. In Encyclopedia of Algorithms, 588–92. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_262.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Nikoletseas, Sotiris, und Olivier Powell. „Obstacle Avoidance Algorithms in Wireless Sensor Networks“. In Encyclopedia of Algorithms, 1434–39. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_262.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Ofek, Yoram, und Moti Yung. „Efficient mechanism for fairness and deadlock-avoidance in high-speed networks“. In Distributed Algorithms, 192–212. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54099-7_14.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Molinos, E., J. Pozuelo, A. Llamazares, M. Ocaña und J. López. „Comparison of Local Obstacle Avoidance Algorithms“. In Computer Aided Systems Theory - EUROCAST 2013, 39–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53862-9_6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Guzzi, Jérôme, Alessandro Giusti, Luca M. Gambardella und Gianni A. Di Caro. „Bioinspired Obstacle Avoidance Algorithms for Robot Swarms“. In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 120–34. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06944-9_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Salomon, Ralf. „Resampling and its avoidance in genetic algorithms“. In Lecture Notes in Computer Science, 335–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0040786.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Cook, Robert P., Lifeng Hsu und Sang H. Son. „Real-Time, Priority-Ordered, Deadlock Avoidance Algorithms“. In Foundations of Real-Time Computing: Scheduling and Resource Management, 307–24. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-3956-8_11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Huang, Chung-Ming, Rung-Shiang Cheng und Yin-Ming Li. „The Registration-Based Collision Avoidance Mechanism for IEEE 802.11ah“. In Pervasive Systems, Algorithms and Networks, 240–55. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30143-9_19.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Avoidance algorithms"

1

Simpson, Alexander, und Chelsea M. Sabo. „Quadcopter Obstacle Avoidance using Biomimetic Algorithms“. In AIAA Infotech @ Aerospace. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2016. http://dx.doi.org/10.2514/6.2016-0403.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Budakova, Dilyana, Galya Pavlova, Roumen Trifonov und Ivan Chavdarov. „Obstacle avoidance algorithms for mobile robots“. In CompSysTech '19: 20th International Conference on Computer Systems and Technologies. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3345252.3345284.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Wedel, Jan W., Björn Schünemann und Ilja Radusch. „V2X-Based Traffic Congestion Recognition and Avoidance“. In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.71.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Colombo, Alessandro, und Domitilla Del Vecchio. „Efficient algorithms for collision avoidance at intersections“. In the 15th ACM international conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2185632.2185656.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Moshchuk, Nikolai, Shih-Ken Chen, Chad Zagorski und Amy Chatterjee. „Path Planning for Collision Avoidance Maneuver“. In ASME 2013 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/imece2013-63893.

Der volle Inhalt der Quelle

Annotation:

This paper summarizes the development of an optimal path planning algorithm for collision avoidance maneuver. The goal of the optimal path is to minimize distance to the target vehicle ahead of the host vehicle subject to vehicle and environment constraints. Such path constrained by allowable lateral (centripetal) acceleration and lateral acceleration rate (jerk). Two algorithms with and without lateral jerk limitation, are presented. The algorithms were implemented in Simulink and verified in CarSim. The results indicate that the lateral jerk limitation increases time-to-collision threshold and leads to a larger distance to the target required for emergency lane change. Collision avoidance path without lateral jerk limitation minimizes the distance to the target vehicle and is suitable for path tracking control in real-time application; however tracking such a path requires very aggressive control.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Jeng, Andy An-Kai, Rong-Hong Jan, Chien Chen und Tsun-Chieh Chiang. „Efficient Broadcast Mechanism for Cooperative Collision Avoidance Using Power Control“. In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.43.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Biswas, Susmit, Diana Franklin, Timothy Sherwood und Frederic T. Chong. „Con?ict-Avoidance in Multicore Caching for Data-Similar Executions“. In 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks. IEEE, 2009. http://dx.doi.org/10.1109/i-span.2009.58.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Abbaspour, Adel, Hadi Zare Jafari, Mohammad Ali Askari Hemmat und Khalil Alipour. „Redundancy Resolution for Singularity Avoidance of Wheeled Mobile Manipulators“. In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-38639.

Der volle Inhalt der Quelle

Annotation:

Mobile robots consist of a mobile platform with manipulator can provide interesting functionalities in a number of applications, since, combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the existence of multiple solutions in a specified workspace. This paper presents a novel combination of evolutionary algorithms and artificial potential field theory for motion planning of mobile manipulator which guaranteed collision and singularity avoidance. In the proposed algorithm, the developed concepts of potential field method are applied to obstacle avoidance and interaction of mobile base with manipulator is used as a new idea for singularity avoidance ability of intermediate links for mobile operations. For this purpose, kinematic and dynamic modeling is derived to define redundant solutions. Afterward, methods from potential field theory combine with evolutionary algorithms to provide an optimum solution among possibly of redundancy resolution scheme. A controller based on dynamic feedback linearization is augmented to track the selective motion trajectory. Simulation results verify obstacle avoidance, singularity avoidance for the manipulators and asymptotic convergence of the robots errors.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Penaranda Cebrian, Roberto, Crispin Gomez Requena, Maria Engracia Gomez Requena, Pedro Lopez und Jose Duato Marin. „HoL-Blocking Avoidance Routing Algorithms in Direct Topologies“. In 2014 IEEE International Conference on High-Performance Computing and Communications (HPCC), 2014 IEEE 6th International Symposium on Cyberspace Safety and Security (CSS) and 2014 IEEE 11th International Conference on Embedded Software and Systems (ICESS). IEEE, 2014. http://dx.doi.org/10.1109/hpcc.2014.9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Kotikalapudi, Poojith, und Vinayak Elangovan. „Obstacle Avoidance and Path Finding for Mobile Robot Navigation“. In 9th International Conference on Natural Language Processing (NLP 2020). AIRCC Publishing Corporation, 2020. http://dx.doi.org/10.5121/csit.2020.101425.

Der volle Inhalt der Quelle

Annotation:

This paper investigates different methods to detect obstacles ahead of a robot using a camera in the robot, an aerial camera, and an ultrasound sensor. We also explored various efficient path finding methods for the robot to navigate to the target source. Single and multi-iteration anglebased navigation algorithms were developed. The theta-based path finding algorithms were compared with the Dijkstra’s Algorithm and their performance were analyzed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Avoidance algorithms"

1

Stevens, W. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC Editor, Januar 1997. http://dx.doi.org/10.17487/rfc2001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Von Wahlde, Raymond, Nathan Wiedenman, Wesley A. Brown und Cezarina Viqueira. An Open-Path Obstacle Avoidance Algorithm Using Scanning Laser Range Data. Fort Belvoir, VA: Defense Technical Information Center, Februar 2009. http://dx.doi.org/10.21236/ada494907.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Rear End Crash Avoidance System (RECAS) Algorithms and Alerting Strategies. Iowa City, Iowa: University of Iowa Public Policy Center, Februar 2006. http://dx.doi.org/10.17077/q89n-flvk.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!