Einloggen

Thematische Bibliographien / View Planning Algorithm

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „View Planning Algorithm“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

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 "View Planning Algorithm" 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 "View Planning Algorithm"

1

Cui, Zhiqiang, Zhaoyang Liao, Xubin Lin, Kezheng Sun, Taobo Cheng und Xuefeng Zhou. „Multi-View consistency-based point cloud registration method with low overlap rate“. Journal of Physics: Conference Series 2724, Nr. 1 (01.03.2024): 012034. http://dx.doi.org/10.1088/1742-6596/2724/1/012034.

Der volle Inhalt der Quelle

Annotation:

Abstract Accurate and efficient workpiece measurement is crucial for workpiece processing and quality monitoring. Non-contact optical measurement methods have gained more attention due to their simplicity, efficiency, and flexibility compared to complicated and inefficient contact measurement methods. Multi-view registration of measurement data is a key issue in workpiece measurement, as it relies on the system’s geometric accuracy and motion stability, presenting challenges such as the insufficient overlap of multi-viewpoint cloud data and cumulative error. To address these challenges, this paper proposes a multi-view planning and registration algorithm with a low overlap rate. The multi-view planning algorithm employs a greedy method to plan the scanning viewpoints of the workpiece to obtain complete point cloud data efficiently. The multi-view registration algorithm extracts features using a multi-scale geometric feature extraction network, matches the features based on the Hungarian algorithm, builds a graph, and optimizes workpiece positions based on the G2O algorithm for multi-view registration, effectively reducing cumulative error. Measurement experiments on blade workpieces confirm the feasibility of the proposed algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Yuan, Ye, Lei Liu, Yu Kuan Sun und Jian Ming Wang. „Indoor Mobile-Robot Path Panning Based Bird’s Eye View Images“. Applied Mechanics and Materials 654 (Oktober 2014): 167–72. http://dx.doi.org/10.4028/www.scientific.net/amm.654.167.

Der volle Inhalt der Quelle

Annotation:

Navigation is essential function for a mobile robot to make it navigate in its environment. The navigation based on bird’s eye view images is a newly proposed indoor visual navigation framework, which can help to simplify the navigation problems, such as self-localization, map-building, path planning and other competences. In the paper, a path planning algorithm applied to the indoor visual navigation is proposed. Firstly, three planning conditions are adopted as the constraints for algorithm design, and then the algorithm is explained. Finally, simulation and practical experiments were implemented and the results were analyzed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Wang, Haiyan, und Zhiyu Zhou. „A Heuristic Elastic Particle Swarm Optimization Algorithm for Robot Path Planning“. Information 10, Nr. 3 (06.03.2019): 99. http://dx.doi.org/10.3390/info10030099.

Der volle Inhalt der Quelle

Annotation:

Path planning, as the core of navigation control for mobile robots, has become the focus of research in the field of mobile robots. Various path planning algorithms have been recently proposed. In this paper, in view of the advantages and disadvantages of different path planning algorithms, a heuristic elastic particle swarm algorithm is proposed. Using the path planned by the A* algorithm in a large-scale grid for global guidance, the elastic particle swarm optimization algorithm uses a shrinking operation to determine the globally optimal path formed by locally optimal nodes so that the particles can converge to it rapidly. Furthermore, in the iterative process, the diversity of the particles is ensured by a rebound operation. Computer simulation and real experimental results show that the proposed algorithm not only overcomes the shortcomings of the A* algorithm, which cannot yield the shortest path, but also avoids the problem of failure to converge to the globally optimal path, owing to a lack of heuristic information. Additionally, the proposed algorithm maintains the simplicity and high efficiency of both the algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Davies, Toby, Adrian Pearce, Peter Stuckey und Harald Søndergaard. „Fragment-Based Planning Using Column Generation“. Proceedings of the International Conference on Automated Planning and Scheduling 24 (10.05.2014): 83–91. http://dx.doi.org/10.1609/icaps.v24i1.13628.

Der volle Inhalt der Quelle

Annotation:

We introduce a novel algorithm for temporal planning in Golog using shared resources, and describe the Bulk Freight Rail Scheduling Problem, a motivating example of such a temporal domain. We use the framework of column generation to tackle complex resource constrained temporal planning problems that are beyond the scope of current planning technology by combining: the global view of a linear programming relaxation of the problem; the strength of search infinding action sequences; and the domain knowledge that can be encoded in a Golog program. We show that our approach significantly outperforms state-of-the-art temporal planning and constraint programming approaches in this domain, in addition to existing temporal Golog implementations. We also apply our algorithm to a temporal variant of blocks-world where our decomposition speeds proof of optimality significantly compared to other anytime algorithms. We discuss the potential of the underlying algorithm being applicable to STRIPS planning, with further work.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Wang, Ting-Ting, Xue Han, Jun Zhou und Hua Chen. „Path planning for visual servoing with search algorithm“. Advances in Mechanical Engineering 10, Nr. 1 (Januar 2018): 168781401775026. http://dx.doi.org/10.1177/1687814017750264.

Der volle Inhalt der Quelle

Annotation:

To solve the visual servoing tasks in complex environment, a path planning method based on improved rapidly exploring random trees algorithm is proposed. First, the improved rapidly exploring random trees planning method is adopted, which keeps the observed feature points in the field of view. The start node and the desired node are initialized as roots of multi-trees which grow harmoniously to plan path of the robot. Then, the planned path is used to project the three-dimensional target feature points into the image space and obtain the feature trajectory for the image-based visual servoing controller. Finally, the feature trajectory is tracked by the image-based visual servoing controller. The proposed visual servoing design method takes field of view constraints, camera retreat problem, and obstacle avoidance into consideration, which can significantly improve the ability of the robotic manipulator, especially in the narrow space. Simulation and experiment on 6-degree-of-freedom robot are conducted. The results present the effectiveness of the proposed algorithm.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Qian, Lanmei, Haifei Zhang, Jianlin Qiu, Xudong Zhang, Hassan Fouad und Torki Altameem. „Mobile Multiple Sink Path Planning for Large-Scale Sensor Networks Based on Hyper-Heuristic Artificial Bee Colony Algorithm“. Journal of Nanoelectronics and Optoelectronics 18, Nr. 3 (01.03.2023): 329–37. http://dx.doi.org/10.1166/jno.2023.3400.

Der volle Inhalt der Quelle

Annotation:

Large-scale wireless sensor networks consists a terrific amount of nodes, a wide range of deployment, extended data transmission time, and large network energy consumption. To solve the above problems, a mobile multiple Sink path planning based on hyper-heuristic artificial bee colony algorithm is proposed. The artificial bee colony algorithm is used as the high-level strategy. In view of the changes in the network operation process, namely the number of nodes and energy changes, the design of three stages of the artificial bee colony algorithm is used to choose and manipulate the low-level heuristic operator. The selected lower layer operator set plans the path of each mobile sink nodes. Compared with other famous meta-heuristic algorithms, it is proved that the proposed hyper-heuristic algorithm is an effective, efficient and robust algorithm, which can effectively solve the path planning problem in view of multiple sink nodes, reduce network delay and reduce network energy consumption.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Lou, Na. „Analysis of the Intelligent Tourism Route Planning Scheme Based on the Cluster Analysis Algorithm“. Computational Intelligence and Neuroscience 2022 (28.06.2022): 1–10. http://dx.doi.org/10.1155/2022/3310676.

Der volle Inhalt der Quelle

Annotation:

In view of the problems of the traditional cluster analysis algorithm such as strong dependence on the initial cluster center, the traditional k-means cluster analysis algorithm is improved and the experiment proves that the improved algorithm has a better clustering effect; in view of the problems of the traditional tourism route planning, the improved k-means cluster analysis algorithm is applied to the intelligent tourism route planning scheme design and an intelligent tourism planning scheme based on the cluster analysis algorithm is proposed; the tourists’ preference metric is fully considered, and the experimental results show that the scheme has certain reasonableness and reference value.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Yang, Wen Jun, Huai Bin Wang und Jing Hui Wang. „Research on Path Planning for Mobile Robot Based on Grid and Hybrid of GA/SA“. Advanced Materials Research 479-481 (Februar 2012): 1499–503. http://dx.doi.org/10.4028/www.scientific.net/amr.479-481.1499.

Der volle Inhalt der Quelle

Annotation:

Path planning is the kernel problem of the robot technology area. In this paper, the grid method is used to make environmental modeling, Since the Genetic Algorithm (GA) has its immanent limitations and the Simulated Annealing (SA) Algorithm has the advantages in some aspects, combined these two algorithms together just achieve the perfection. In view of this, a hybrid of GA and SA (GA-SA Hybrid) is proposed in this paper to solve path planning problem for mobile robot. The algorithm making the crossover and mutation probability adjusted adaptively and nonlinearly with the completion time, can avoid such disadvantages as premature convergence. The new algorithm has better capability of searching globally and locally. The simulation results demonstrate that the proposed algorithm is valid and effective.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Banyai, Tamas. „SENSITIVITY ANALYSIS OF WAGNER-WHITIN ALGORITHM“. Journal of Production Engineering 25, Nr. 1 (30.06.2022): 37–42. http://dx.doi.org/10.24867/jpe-2022-01-037.

Der volle Inhalt der Quelle

Annotation:

Material requirement planning (MRP) plays an important role in the efficiency improvement of manufacturing companies. The MRP solutions of enterprise resource planning (ERP) systems are influenced by both technological and logistics parameters, but using additional algorithms, like Wagner-Whitin or Silver-Meal heuristics, it is possible to take more parameters into consideration. These heuristics can optimise the results of MRP, especially from ordering, warehousing and transportation costs point of view. Within the frame of this article the impact of process parameters on the result of Wagner-Whitin algorithm are described.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Hanks, S., und D. S. Weld. „A Domain-Independent Algorithm for Plan Adaptation“. Journal of Artificial Intelligence Research 2 (01.01.1995): 319–60. http://dx.doi.org/10.1613/jair.79.

Der volle Inhalt der Quelle

Annotation:

The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation - modifying or repairing an old plan so it solves a new problem. In this paper we provide a domain-independent algorithm for plan adaptation, demonstrate that it is sound, complete, and systematic, and compare it to other adaptation algorithms in the literature. Our approach is based on a view of planning as searching a graph of partial plans. Generative planning starts at the graph's root and moves from node to node using plan-refinement operators. In planning by adaptation, a library plan - an arbitrary node in the plan graph - is the starting point for the search, and the plan-adaptation algorithm can apply both the same refinement operators available to a generative planner and can also retract constraints and steps from the plan. Our algorithm's completeness ensures that the adaptation algorithm will eventually search the entire graph and its systematicity ensures that it will do so without redundantly searching any parts of the graph.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "View Planning Algorithm"

1

Guo, Yixuan. „Hexapod Gait Planning and Obstacle Avoidance Algorithm“. University of Toledo / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1461868607.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Yue, Weiya Ph D. „Improving Dynamic Navigation Algorithms“. University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1368028468.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Suh, Suk-Hwan. „Development of an algorithm for a minimum-time trajectory planning problem under practical considerations /“. The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487267546984019.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Joseph, Jose. „UAV Path Planning with Communication Constraints“. University of Cincinnati / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1563872872304696.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Mathur, Kush. „Mathematical Models and Genetic Algorithm Approaches to Simultaneously Perform Workforce Overtime Capacity Planning and Schedule Cells“. Ohio University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1351306927.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Chan, Philip. „Dosimetric verification of the ADAC Pinnacle³ pencil beam algorithm for clinical electrons in presence of cerrobend blocking“. Connect to full text in OhioLINK ETD Center, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=mco1211993729.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.)--University of Toledo, 2008.
"In partial fulfillment of the requirements for the degree of Master of Science in Biomedical Sciences." Title from title page of PDF document. "Date of Defense: December 12, 2007" -- Approval page. Bibliography: p. 71-73.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Rathore, Aishvarya. „Quality Analysis of UAV based 3D Reconstruction and its Applications in Path Planning“. University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1627658323958222.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Rajaraman, Srinivas. „Space Search Based Algorithm for Cell Formation with Alternative Process Plans“. Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1082146485.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Kingry, Nathaniel. „Heuristic Optimization and Sensing Techniques for Mission Planning of Solar-Powered Unmanned Ground Vehicles“. The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1523874767812408.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Lakshminarayanan, Srinivasan. „Nature Inspired Discrete Integer Cuckoo Search Algorithm for Optimal Planned Generator Maintenance Scheduling“. University of Toledo / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1438101954.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "View Planning Algorithm"

1

Wang, Yali, Yun Hao und Ying Wang. „The Scan View Planning Algorithm Based on the CAD Model“. In Lecture Notes in Electrical Engineering, 1975–83. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-6571-2_240.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Cao, Jun, Fanyu Wang, Zhenping Xie und She Song. „Imputation Algorithm for Multi-view Financial Data Based on Weighted Random Forest“. In Proceedings of the 2023 2nd International Conference on Urban Planning and Regional Economy (UPRE 2023), 55–70. Dordrecht: Atlantis Press International BV, 2023. http://dx.doi.org/10.2991/978-94-6463-218-7_8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Danilevich, Aleksey B., Michael N. Rychagov und Mikhail Y. Sirotenko. „Automatic View Planning in Magnetic Resonance Imaging“. In Smart Algorithms for Multimedia and Imaging, 277–302. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-66741-2_11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Ensari, Elif, José Beirão und Mine Özkar. „Street Voids: Analyzing Street-Level Walkability Based on 3D Morphology and Remotely Accessible Urban Data“. In Communications in Computer and Information Science, 236–52. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37189-9_16.

Der volle Inhalt der Quelle

Annotation:

AbstractUrban planning and design approaches that aim to leverage walking as a sustainable means of transportation require a thorough understanding of the built environment. Information regarding density, diversity, accessibility, and attractiveness of streets is critical to assess walkability, yet it is also resource-intensive to acquire through traditional methods. We present a computational analysis method that captures and aggregates information on walkability indicators encapsulated in the 3d morphology, street-view imagery, and POI data of streets, using a 3d component called the Street Void [1]. This component builds on the Convex and Solid-Void models [2] which are 3d representations of open-urban spaces informed by the interrelationships between topography, surrounding buildings and other immediate physical boundaries, and facilitates the quantitative evaluation of walkability attributes. The method is unique in that it allows for the walkability evaluation of urban open spaces in the micro level, with a semi-automated algorithm and utilizing remotely accessible urban data. We present the implementation of this analysis on four neighborhoods of Istanbul and Lisbon, demonstrating insight drawn from its quantitative output. The research interconnects knowledge in the domains of computational design, behavioral psychology, urban management, and planning; with the contribution of a novel quantitative analysis of streets to inform urban decision-making processes.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Shanthakumar, Prajwal, Kevin Yu, Mandeep Singh, Jonah Orevillo, Eric Bianchi, Matthew Hebdon und Pratap Tokekar. „View Planning and Navigation Algorithms for Autonomous Bridge Inspection with UAVs“. In Springer Proceedings in Advanced Robotics, 201–10. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-33950-0_18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Harbola, Shubhi, Martin Storz und Volker Coors. „Augmented Reality for Windy Cities: 3D Visualization of Future Wind Nature Analysis in City Planning“. In iCity. Transformative Research for the Livable, Intelligent, and Sustainable City, 241–50. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92096-8_15.

Der volle Inhalt der Quelle

Annotation:

AbstractEffective government management, convenient public services, and sustainable industrial development are achieved by the thorough utilization and management of green, renewable resources. The research and the study of meteorological data and its effect on devising renewable solutions as a replacement for nonrenewable ones is the motive of researchers and city planners. Sources of energy like wind and solar are free, green, and popularly being integrated into sustainable development and city planning to preserve environmental quality. Sensor networks have become a convenient tool for environmental monitoring. Wind energy generated through the use and maintenance of wind turbines requires knowledge of wind parameters such as speed and direction for proper maintenance. An augmented reality (AR) tool for interactive visualization and exploration of future wind nature analyses for experts is still missing. Existing solutions are limited to graphs, tabular data, two-dimensional space (2D) maps, globe view, and GIS tool designed for the desktop and not adapted with AR for easy, interactive mobile use. This work aims to provide a novel AR-based mobile supported application (App) that serves as a bridge between three-dimensional space (3D) temporal wind dataset visualization and predictive analysis through machine learning (ML). The proposed development is a dynamic application of AR supported with ML. It provides a user interactive designed approach, presenting a multilayered infrastructure process accessed through a mobile AR platform that supports 3D visualization of temporal wind data through future wind analysis. Thus, a novel AR visualization App with the prediction of wind nature using ML algorithms would provide city planners with advanced knowledge of wind conditions and help in easy decision-making with interactive 3D visualization.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Valk, Jeroen, Mathijs de Weerdt und Cees Witteveen. „Coordination in Multi-Agent Planning with an Application in Logistics“. In Intelligent Techniques for Planning, 194–224. IGI Global, 2005. http://dx.doi.org/10.4018/978-1-59140-450-7.ch006.

Der volle Inhalt der Quelle

Annotation:

Multi-agent planning comprises planning in an environment with multiple autonomous actors. Techniques for multi-agent planning differ from conventional planning in that planning activities are distributed and the planning autonomy of the agents must be respected. We focus on approaches to coordinate the multi-agent planning process. While usually coordination is intertwined with the planning process, we distinguish a number of separate phases in the planning process to get a clear view on the different role(s) of coordination. In particular, we discuss the pre-planning coordination phase and post-planning coordination phase. In the pre-planning part, we view coordination as the process of managing (sub) task dependencies and we discuss a method that ensures complete planning autonomy by introducing additional (intra-agent) dependencies. In the post-planning part, we will show how agents can improve their plans through the exchange of resources. We present a plan merging algorithm that uses these resources to reduce the costs of independently developed plans. This (any-time) algorithm runs in polynomial time.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Nantabut, Chinnawut, und Dirk Abel. „Prioritized Anytime Dynamic A* Path Planning for Multi-Agent Vehicles in Heterogeneous Traffic“. In Advances in Transdisciplinary Engineering. IOS Press, 2023. http://dx.doi.org/10.3233/atde230006.

Der volle Inhalt der Quelle

Annotation:

For a centralized path planning in the multi-agent path finding (MAPF), especially for road vehicles using traffic rules, a prioritized planning algorithm is one of the key methods that deal with real-time problems. The time used for planning is limited, especially when a number of agents are present, and a suboptimal solution has to be found. If possible, the previous solution should be reused for the replanning. Anytime Dynamic A* (AD*) can both replan the path when the environment is changed dynamically and is able to return a safe, but potentially suboptimal solution in case where a maximum cycle time is exceeded. A prioritized order selection is based on the path length to the goal. To model heterogeneous traffics with vehicles and pedestrians, a combination of the bicycle and pedestrian obstacle reciprocal collision avoidance algorithms (B-ORCA and PORCA) is used to realize a naturalistic interaction among the multi-agent system and the dynamic environment. The number of agents and of dynamic obstacles is randomly generated and the time used for planning is analyzed in view of the limited time available in the simulations. In this work, the path planning of up to three agents can be executed in real-time in MATLAB.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Rieffel, Eleanor G., Stuart Hadfield, Tad Hogg, Salvatore Mandrà, Jeffrey Marshall, Gianni Mossi, Bryan O’Gorman et al. „From Ansätze to Z-Gates: A NASA View of Quantum Computing“. In Future Trends of HPC in a Disruptive Scenario. IOS Press, 2019. http://dx.doi.org/10.3233/apc190010.

Der volle Inhalt der Quelle

Annotation:

For the last few years, the NASA Quantum Artificial Intelligence Laboratory (QuAIL) has been performing research to assess the potential impact of quantum computers on challenging computational problems relevant to future NASA missions. A key aspect of this research is devising methods to most effectively utilize emerging quantum computing hardware. Research questions include what experiments on early quantum hardware would give the most insight into the potential impact of quantum computing, the design of algorithms to explore on such hardware, and the development of tools to minimize the quantum resource requirements. We survey work relevant to these questions, with a particular emphasis on our recent work in quantum algorithms and applications, in elucidating mechanisms of quantum mechanics and their uses for quantum computational purposes, and in simulation, compilation, and physics-inspired classical algorithms. To our early application thrusts in planning and scheduling, fault diagnosis, and machine learning, we add thrusts related to robustness of communication networks and the simulation of many-body systems for material science and chemistry. We provide a brief update on quantum annealing work, but concentrate on gate-model quantum computing research advances within the last couple of years.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Rodgers, Waymond. „Understanding Throughput Decision-making Modeling“. In Dominant Algorithms to Evaluate Artificial Intelligence: From the view of Throughput Model, 29–68. BENTHAM SCIENCE PUBLISHERS, 2022. http://dx.doi.org/10.2174/9789815049541122010004.

Der volle Inhalt der Quelle

Annotation:

Individuals and organizations need to make decisions daily. Given limited time in formulating issues and addressing problems, individuals and organizations must enjoy a certain degree of discretion in planning, revising, and implementing strategies. The Throughput Model facilitates individuals and organizations to simplify process models by modeling perception, information, judgment, and decision choice in a parallel modeling and neural network system. In addition, the Throughput Model allows for a fundamental and wide-ranging approach to understanding first through fifth dimensions dealing with problem solving as well as advancing our knowledge towards quantum computing

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "View Planning Algorithm"

1

Liu, Yahui, Xulong Li und Qingxuan Jia. „A path planning optimization algorithm based on multi-view images“. In 2017 12th IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2017. http://dx.doi.org/10.1109/iciea.2017.8282975.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

García, M. A., S. Velázquez und A. D. Sappa. „A Two-Stage Algorithm for Planning the Next View From Range Images“. In British Machine Vision Conference 1998. British Machine Vision Association, 1998. http://dx.doi.org/10.5244/c.12.72.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Kong, Yanzi, Feng Zhu, Haibo Sun, Qun Wang und Zhiyuan Lin. „A Generic View Planning Algorithm Based on Formal Description of Perception Tasks“. In 2021 IEEE International Conference on Robotics and Biomimetics (ROBIO). IEEE, 2021. http://dx.doi.org/10.1109/robio54168.2021.9739270.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Ma, Feiyu, und Xiaoyu Ma. „Research on Path Planning of Mobile Robot Based on Global View Ant Colony Algorithm“. In EITCE 2021: 2021 5th International Conference on Electronic Information Technology and Computer Engineering. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3501409.3501641.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Vasev, Pavel Alexandrovich. „3D visualization of HPC Tasks Scheduling Algorithm“. In 33rd International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2023. http://dx.doi.org/10.20948/graphicon-2023-341-353.

Der volle Inhalt der Quelle

Annotation:

The paper is devoted to the issue of visualization of the algorithm for scheduling parallel tasks. Task planning is a key part of the online visualization and parallel programming environment developed by the author. When programming a parallel version of one application task, a suspicion arose that the scheduling algorithm does not optimally distribute the load between the performers. In this connection, it was decided to visualize its work in order to see the overall picture and possible problem areas of the algorithm. The display view works in three-dimensional space and visualizes the assignment of tasks with dots. The coordinates of the points are determined by the logical time, the sequence number of the core (performer), and the sequence number of the data block from the decomposition of the task. The color of the dots is set by the task type. Dependencies between data tasks are shown in segments. The constructed view of the display successfully coped with the task, and the planning algorithm was improved.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Son, Tran Cao, Tiep Le, Patrick Kahl und Anthony Leclerc. „On Computing World Views of Epistemic Logic Programs“. In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/176.

Der volle Inhalt der Quelle

Annotation:

This paper presents a novel algorithm for computing world views of different semantics of epistemic logic programs (ELP) and two of its realization, called Ep-asp (for an older semantics) and Ep-asp^{se} (for the newest semantics), whose implementation builds on the theoretical advancement in the study of ELPs and takes advantage of the multi-shot computation paradigm of the answer set solver Clingo. The new algorithm differs from the majority of earlier algorithms in its strategy. Specifically, it computes one world view at a time and utilizes properties of world views to reduce its search space. It starts by computing an answer set and then determines whether or not a world view containing this answer set exists. In addition, it allows for the computation to focus on world views satisfying certain properties. The paper includes an experimental analysis of the performance of the two solvers comparing against a recently developed solver. It also contains an analysis of their performance in goal directed computing against a logic programming based conformant planning system, dlv-k. It concludes with some final remarks and discussion on the future work.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Geraskin, Mikhail I., und Victoria V. Egorova. „THE ALGORITHM FOR DYNAMIC OPTIMIZATION OF THE PRODUCTION CYCLE IN BEARING INDUSTRY“. In Information Technology and Nanotechnology-2016. IP Zaitsev V.D., 2016. http://dx.doi.org/10.18287/1613-0073-2016-1638-552-568.

Der volle Inhalt der Quelle

Annotation:

The authors consider the problems in production resources optimization planning by production cycle criteria inside the business process of industrial companies working in the interim manufacturing sectors. The authors have worked-out the models of static and dynamic order optimization for the company production resources in view of pricing and process restrictions. We have also developed the production cycle mechanism optimization to be used in simulating the optimum programs for the companies that work in Russian bearing industry.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Du, Bin, Jing Zhao und Chunyu Song. „Optimal Base Placement and Motion Planning for Mobile Manipulators“. In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70600.

Der volle Inhalt der Quelle

Annotation:

A mobile manipulator typically consists of a mobile platform and a robotic manipulator mounted on the platform. The base placement of the platform has a great influence on whether the manipulator can perform a given task. In view of the issue, a new approach to optimize the base placement for a specified task is proposed in this paper. Firstly, the workspace of a redundant manipulator is investigated. The manipulation capability of the redundant manipulator is maximized based on the manipulability index through the joint self-motion of the redundant manipulator. Then the maximum manipulation capability in the specified work point is determined. Next, the relative manipulability index (RMI) is defined for analyzing manipulation capability of the manipulator in its workspace, and the global manipulability map (GMM) is presented based on the above measure. Moreover, the optimal base placement related to the given task is obtained, and the motion planning is implemented by an improved rapidly-exploring random tree (RRT) algorithm with the RMI, which can enhance the manipulation capability from the initial point to the target point. Finally, the feasibility of the proposed algorithm is illustrated with numerical simulations and experiments on the mobile manipulator.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Gaines, Daniel M., und Caroline C. Hayes. „A Constraint-Based Algorithm for Reasoning About the Shape Producing Capabilities of Cutting Tools in Machined Parts“. In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dfm-4322.

Der volle Inhalt der Quelle

Annotation:

Abstract The tools and processes available in a given shop greatly influence the way in which manufacturers view a part and the way in which they decompose it into manufacturable volumes (features). It would be very useful to manufacturers to have an automated process planning assistant that would allow them 1) to specify their own, possibly special purpose, and 2) show them the impact that adding those tools will have on the way in which the part can be decomposed into features and on the manufacturing methods that can be used in the process plan. In this paper, we present 1) Tool-Editor, which allows users to enter their own tool shapes in a specification derived from the National Institute of Standards and Technologies’ specification for manufacturing resources; and 2) Tool-Mapper, a method for identifying the regions of the part that each tool can produce and generating a method which describes how the tools can make the identified shapes. If the first stage of traditional process planning can be viewed as translating features into processes, then Tool-Mapper can be viewed as the reverse process in which tools are translated into shapes. The benefit offered by tool-mapping is that it provides a mechanism for allowing users to input tools specific to their shop, without requiring them to reprogram the system, or to perform more knowledge acquisition to determine the impact of changing the tools.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Wang, Zhenyu, Zhuoping Yu, Wei Tian, Lu Xiong und Chen Tang. „A Method for Building Vehicle Trajectory Data Sets Based on Drone Videos“. In WCX SAE World Congress Experience. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 2023. http://dx.doi.org/10.4271/2023-01-0714.

Der volle Inhalt der Quelle

Annotation:

<div class="section abstract"><div class="htmlview paragraph">The research and development of data-driven highly automated driving system components such as trajectory prediction, motion planning, driving test scenario generation, and safety validation all require large amounts of naturalistic vehicle trajectory data. Therefore, a variety of data collection methods have emerged to meet the growing demand. Among these, camera-equipped drones are gaining more and more attention because of their obvious advantages. Specifically, compared to others, drones have a wider field of bird's eye view, which is less likely to be blocked, and they could collect more complete and natural vehicle trajectory data. Besides, they are not easily observed by traffic participants and ensure that the human driver behavior data collected is realistic and natural. In this paper, we present a complete vehicle trajectory data extraction framework based on aerial videos. It consists of three parts: 1) objects detection, 2) data association, and 3) data cleaning. In particular, considering that the hovering drone can be approximated as a fixed camera, we propose an improved object detection algorithm based on classical image processing algorithms. It overcomes the shake effects of drone-based aerial videos and can be directly applied to the automatic detection of moving vehicles without manual annotation data. The output of the algorithm is the vehicle rotated bounding box information with high accuracy, including vehicle center position, vehicle heading, and vehicle dimension. In addition, the improved detection algorithm can be used for vehicle object automatic annotation.</div></div>

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "View Planning Algorithm"

1

Lewis, Dustin. Three Pathways to Secure Greater Respect for International Law concerning War Algorithms. Harvard Law School Program on International Law and Armed Conflict, 2020. http://dx.doi.org/10.54813/wwxn5790.

Der volle Inhalt der Quelle

Annotation:

Existing and emerging applications of artificial intelligence in armed conflicts and other systems reliant upon war algorithms and data span diverse areas. Natural persons may increasingly depend upon these technologies in decisions and activities related to killing combatants, destroying enemy installations, detaining adversaries, protecting civilians, undertaking missions at sea, conferring legal advice, and configuring logistics. In intergovernmental debates on autonomous weapons, a normative impasse appears to have emerged. Some countries assert that existing law suffices, while several others call for new rules. Meanwhile, the vast majority of efforts by States to address relevant systems focus by and large on weapons, means, and methods of warfare. Partly as a result, the broad spectrum of other far-reaching applications is rarely brought into view. One normatively grounded way to help identify and address relevant issues is to elaborate pathways that States, international organizations, non-state parties to armed conflict, and others may pursue to help secure greater respect for international law. In this commentary, I elaborate on three such pathways: forming and publicly expressing positions on key legal issues, taking measures relative to their own conduct, and taking steps relative to the behavior of others. None of these pathways is sufficient in itself, and there are no doubt many others that ought to be pursued. But each of the identified tracks is arguably necessary to ensure that international law is — or becomes — fit for purpose. By forming and publicly expressing positions on relevant legal issues, international actors may help clarify existing legal parameters, pinpoint salient enduring and emerging issues, and detect areas of convergence and divergence. Elaborating legal views may also help foster greater trust among current and potential adversaries. To be sure, in recent years, States have already fashioned hundreds of statements on autonomous weapons. Yet positions on other application areas are much more difficult to find. Further, forming and publicly expressing views on legal issues that span thematic and functional areas arguably may help States and others overcome the current normative stalemate on autonomous weapons. Doing so may also help identify — and allocate due attention and resources to — additional salient thematic and functional areas. Therefore, I raise a handful of cross-domain issues for consideration. These issues touch on things like exercising human agency, reposing legally mandated evaluative decisions in natural persons, and committing to engage only in scrutable conduct. International actors may also take measures relative to their own conduct. To help illustrate this pathway, I outline several such existing measures. In doing so, I invite readers to inventory and peruse these types of steps in order to assess whether the nature or character of increasingly complex socio-technical systems reliant upon war algorithms and data may warrant revitalized commitments or adjustments to existing measures — or, perhaps, development of new ones. I outline things like enacting legislation necessary to prosecute alleged perpetrators of grave breaches, making legal advisers available to the armed forces, and taking steps to prevent abuses of the emblem. Finally, international actors may take measures relative to the conduct of others. To help illustrate this pathway, I outline some of the existing steps that other States, international organizations, and non-state parties may take to help secure respect for the law by those undertaking the conduct. These measures may include things like addressing matters of legal compliance by exerting diplomatic pressure, resorting to penal sanctions to repress violations, conditioning or refusing arms transfers, and monitoring the fate of transferred detainees. Concerning military partnerships in particular, I highlight steps such as conditioning joint operations on a partner’s compliance with the law, planning operations jointly in order to prevent violations, and opting out of specific operations if there is an expectation that the operations would violate applicable law. Some themes and commitments cut across these three pathways. Arguably, respect for the law turns in no small part on whether natural persons can and will foresee, understand, administer, and trace the components, behaviors, and effects of relevant systems. It may be advisable, moreover, to institute ongoing cross-disciplinary education and training as well as the provision of sufficient technical facilities for all relevant actors, from commanders to legal advisers to prosecutors to judges. Further, it may be prudent to establish ongoing monitoring of others’ technical capabilities. Finally, it may be warranted for relevant international actors to pledge to engage, and to call upon others to engage, only in armed-conflict-related conduct that is sufficiently attributable, discernable, and scrutable.

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!