Relevant bibliographies by topics / Pre-defined path

Contents

  1. Journal articles
  2. Books
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Pre-defined path'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Pre-defined path.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Pre-defined path"

1

Hesser, J., and S. König. "Live-Wires Using Path-Graphs." Methods of Information in Medicine 43, no. 04 (2004): 371–75. http://dx.doi.org/10.1055/s-0038-1633880.

Full text
Abstract:
Summary Objectives: This article discusses our new Path-Graph approach for the interactive Live-Wire segmentation method in 2D applied to pre-segmented data. Furthermore, we examine whether or not the Live-Lane extension provides advantages in combination with pre-segmentation. Methods: We automatically over-segment the image data in a preprocessing step, using region growing with an automatic seed point generation. The Live-Wire algorithm is applied on this mosaic data by using the outlines of the homogeneous regions as the basis for graph building. We present a new definition of this underly
APA, Harvard, Vancouver, ISO, and other styles
2

Massaro, Matteo, Stefano Lovato, Matteo Bottin, and Giulio Rosati. "An Optimal Control Approach to the Minimum-Time Trajectory Planning of Robotic Manipulators." Robotics 12, no. 3 (2023): 64. http://dx.doi.org/10.3390/robotics12030064.

Full text
Abstract:
Trajectory planning is a classic problem in robotics, with different approaches and optimisation objectives documented in the literature. Most of the time, the path is assumed, i.e., pre-defined, and optimisation consists of finding the timing of motion under a number of constraints. The focus of this work is on the minimum-time manoeuvring of robotic manipulators. A nonlinear optimal control approach is proposed that does not require the provision of either a pre-defined path or a pre-defined control structure and allows the inclusion of dynamic constraints. The solution (path and timing of m
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Hangqi. "Analysis and study on path planning algorithms in the further mobile action." Journal of Physics: Conference Series 2824, no. 1 (2024): 012006. http://dx.doi.org/10.1088/1742-6596/2824/1/012006.

Full text
Abstract:
Abstract This study investigates the use of four common path planning algorithms - RRT (Rapidly-Exploring Random Tree), Dijkstra, A*, and ACO (Ant Colony Optimization) - for autonomous endpoint search in pre-defined grid mazes. Path planning is a crucial problem in robot navigation, involving the ability to find optimal paths with the minimum running time in complex environments. In this research, it firstly introduces the basic principles and mechanisms of each algorithm. RRT is a random sampling-based algorithm that explores the search space by generating a tree-like structure randomly. Base
APA, Harvard, Vancouver, ISO, and other styles
4

Atzmon, Dor, Roni Stern, Ariel Felner, Glenn Wagner, Roman Bartak, and Neng-Fa Zhou. "Robust Multi-Agent Path Finding." Proceedings of the International Symposium on Combinatorial Search 9, no. 1 (2021): 2–9. http://dx.doi.org/10.1609/socs.v9i1.18445.

Full text
Abstract:
In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k-robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k-robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose suf
APA, Harvard, Vancouver, ISO, and other styles
5

Hasan, Hameedah Sahib. "Automated Guided Vehicle, Routing and algorithms." Science Proceedings Series 1, no. 2 (2019): 1–3. http://dx.doi.org/10.31580/sps.v1i2.562.

Full text
Abstract:
The routing problem of Automated Guided Vehicle (AGV) targets to discovery the shortest path between two station. AGV is used widly in transporting sysrems. Earily it used in static routing (pre-defined routes), which follow fixed line. Instead of using fixed path, there is another type which is dynamic routing can use to add a high flexibility to the system.To accommodate the increased flexibility and reduce time. In this paper, routing of AGV is introduced. Different AGV shortest path algorithms are presented with highlights their main differences between them. Furthermore, AGV routing in re
APA, Harvard, Vancouver, ISO, and other styles
6

Morris, A. S., and M. A. Mansor. "Manipulator Inverse Kinematics using an Adaptive Back-propagation Algorithm and Radial Basis Function with a Lookup Table." Robotica 16, no. 4 (1998): 433–44. http://dx.doi.org/10.1017/s0263574798001064.

Full text
Abstract:
This is an extension of previous work which used an artificial neural network with a back-propagation algorithm and a lookup table to find the inverse kinematics for a manipulator arm moving along pre-defined trajectories. The work now described shows that the performance of this technique can be improved if the back-propagation is made to be adaptive. Also, further improvement is obtained by using the whole workspace to train the neural network rather than just a pre-defined path. For the inverse kinematics of the whole workspace, a comparison has also been done between the adaptive back-prop
APA, Harvard, Vancouver, ISO, and other styles
7

Chiariotti, Federico, Stepan Kucera, Andrea Zanella, and Holger Claussen. "Analysis and Design of a Latency Control Protocol for Multi-Path Data Delivery With Pre-Defined QoS Guarantees." IEEE/ACM Transactions on Networking 27, no. 3 (2019): 1165–78. http://dx.doi.org/10.1109/tnet.2019.2911122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Viraja, K. "Pick and Place an Object with Robot Gripper Using Arduino." International Journal for Research in Applied Science and Engineering Technology 11, no. 11 (2023): 255–58. http://dx.doi.org/10.22214/ijraset.2023.56462.

Full text
Abstract:
Abstract: This paper presents an automatic system that picks an object from one location and places it in another location. A rover features with special type of wheels called Mecanum wheels. A pre-defined path is designed, and the rover is programmed to move the rover in the desired path. The Arduino IDE software tool is used to write the program and the program is being dumped into the microcontroller. A gripper with two arms is used to pick and place objects that are functionally similar to a hand.
APA, Harvard, Vancouver, ISO, and other styles
9

Ryu, Seokhoon, Jihea Lim, Young-Sup Lee, Eunsuk Yoo, and Chasub Lim. "Enhancing Engine Order Sound Using Additive Feedforward Control for a Secondary Path with Uncertainty at Higher Frequencies." Applied Sciences 12, no. 9 (2022): 4486. http://dx.doi.org/10.3390/app12094486.

Full text
Abstract:
An active sound profiling (ASP) control algorithm based on the command FxLMS with an additive feedforward enhancement is suggested to overcome the limited performance to track a pre-defined target sound in a car cabin when an electronic sound generator (ESG) attached to a cowl panel of a car was adopted as a secondary actuator. As the uncertainty of the secondary path including the ESG-cowl pair was increased especially at higher frequencies, the tracking performance of a pure ASP algorithm was limited. The feedforward enhancement was added to the pure ASP algorithm to allow a robust tracking
APA, Harvard, Vancouver, ISO, and other styles
10

YANG, C. D., D. T. LEE, and C. K. WONG. "ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH." International Journal of Computational Geometry & Applications 02, no. 01 (1992): 61–74. http://dx.doi.org/10.1142/s0218195992000056.

Full text
Abstract:
We consider the problem of finding a rectilinear path between two designated points in the presence of rectilinear obstacles subject to various optimization functions in terms of the number of bends and the total length of the path. Specifically we are interested in finding a minimum bend shortest path, a shortest minimum bend path or a least-cost path where the cost is defined as a function of both the length and the number of bends of the path. We provide a unified approach by constructing a path-preserving graph. guaranteed to preserve all these three kinds of paths and give an O(K+e log e)
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Pre-defined path"

1

Allsen, Thomas T. Pre-modern Empires. Edited by Jerry H. Bentley. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199235810.013.0021.

Full text
Abstract:
Empire is regularly defined as a political unit of large extent controlling a number of territories and peoples under a single sovereign authority. Of the three criteria, only one, sovereign authority, is quantified. In the early sixteenth century, maritime Europe, starting on its own path to empire, encountered large imperial regimes across the globe — the Ottoman, Safavid, Mughal, Ming, Aztec, and Inca — each of which had an identifiable genealogy and model. To a meaningful degree, global political history is simply the oscillation between universal empires and multi-state systems. In their
APA, Harvard, Vancouver, ISO, and other styles
2

Hrushovski, Ehud, and François Loeser. Curves. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691161686.003.0007.

Full text
Abstract:
This chapter proves the iso-definability of unit vector C when C is a curve using Riemann-Roch. Recall that a pro-definable set is called iso-definable if it is isomorphic, as a pro-definable set, to a definable set. If C is an algebraic curve defined over a valued field F, then unit vector C is an iso-definable set. The topology on unit vector C is definably generated, that is, generated by a definable family of (iso)-definable subsets. In other words, there is a definable family giving a pre-basis of the topology. The chapter explains how definable types on C correspond to germs of paths on
APA, Harvard, Vancouver, ISO, and other styles
3

Lange, Ralph. Leading Rome from a Distance, 300 BCE–37 CE. Bloomsbury Publishing Plc, 2024. http://dx.doi.org/10.5040/9781350325432.

Full text
Abstract:
Roman political leaders used distance from Rome as a key political tool to assert pre-eminence. Through the case studies of Caesar’s hegemony, Augustus’s autocracy, and Tiberius’s reign, this book examines how these figures’ experiences and manipulations of absence established a multipolar focus of political life centred less on the city of Rome, and more on the idea of a single leader. The Roman expansion over Italy and the Mediterranean put the political system under considerable stress, and eventually resulted in a dispersal of leadership and a decentralization of power. Absent generals riv
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Pre-defined path"

1

Tavazzi, Erica, Camille L. Gerard, Olivier Michielin, Alexandre Wicky, Roberto Gatta, and Michel A. Cuendet. "A Process Mining Approach to Statistical Analysis: Application to a Real-World Advanced Melanoma Dataset." In Lecture Notes in Business Information Processing. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72693-5_22.

Full text
Abstract:
AbstractThanks to its ability to offer a time-oriented perspective on the clinical events that define the patient’s path of care, Process Mining (PM) is assuming an emerging role in clinical data analytics. PM’s ability to exploit time-series data and to build processes without any a priori knowledge suggests interesting synergies with the most common statistical analyses in healthcare, in particular survival analysis. In this work we demonstrate contributions of our process-oriented approach in analyzing a real-world retrospective dataset of patients treated for advanced melanoma at the Lausa
APA, Harvard, Vancouver, ISO, and other styles
2

Lauer, Sascha, Sebastian Rieck, Martin-Christoph Wanner, and Wilko Flügge. "Partial Automated Multi-Pass-Welding for Thick Sheet Metal Connections." In Annals of Scientific Society for Assembly, Handling and Industrial Robotics 2021. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-74032-0_33.

Full text
Abstract:
AbstractThe production of tubular-node-connections, which are required for the construction of offshore wind energy plants or converter platforms, is subject to high manufacturing standards. The welding process is currently carried out manually and requires a great deal of experience on the part of the welder. In this process, one or more branch member pipes are welded to a base pipe, which vary in their diameters and alignment to each other. This results in a small batch size for which no standard automation solution can be considered. The approach of a pre-defined offline path-planning is no
APA, Harvard, Vancouver, ISO, and other styles
3

Kruse, Kristin, and Esther Schönenberger. "Archiving the Third Dimension: Production, Maintenance and Use of 3D Models in Cultural Heritage Management." In The 3 Dimensions of Digitalised Archaeology. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-53032-6_12.

Full text
Abstract:
AbstractIn 2017, the Archaeology Department of the Canton Zurich defined photogrammetry in Agisoft Metashape as a new standard. The years have shown the advantages of the method, especially when documenting complex 3D structures, like skeletons or ruins, on site. While generating 3D models was a well-trodden path, the storage of 3D models needed some exploration. The first challenge was to incorporate 3D data into a pre-existing archive system. The second challenge was to secure both easy access for everyone and long-term storage at the same time. We propose a solution where access and storage
APA, Harvard, Vancouver, ISO, and other styles
4

Hsueh, Yu-Ling, Roger Zimmermann, and Meng-Han Yang. "Approximate Continuous K Nearest Neighbor Queries for Continuous Moving Objects with Pre-defined Paths." In Perspectives in Conceptual Modeling. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11568346_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fouquier Geoffroy, Atif Jamal, and Bloch Isabelle. "Sequential spatial reasoning in images based on pre-attention mechanisms and fuzzy attribute graphs." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2008. https://doi.org/10.3233/978-1-58603-891-5-611.

Full text
Abstract:
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics, and graphs are well adapted to represent such information. Sequential methods for knowledgebased recognition of structures require to define in which order the structures have to be recognized, which can be expressed as the optimization of a path in the representation graph. We propose to integrate pre-attention mechanisms in the optimization criterion, in the form of a saliency map, by reasoning on the saliency of spatial are
APA, Harvard, Vancouver, ISO, and other styles
6

Patel, Sarosh R., and Tarek Sobh. "Optimal Design of Three-Link Planar Manipulators Using Grashof’s Criterion." In Prototyping of Robotic Systems. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0176-5.ch003.

Full text
Abstract:
The design of robotic manipulators is dictated by a set of pre-determined task descriptions and performance parameters. These performance parameters are often defined in terms of workspace dexterity, manipulability, and accuracy. Many serial manipulator applications require that the manipulator have full dexterity about a work piece or a pre-defined trajectory, that is, to approach the given point within the workspace with all possible orientations about that point. Grashof’s criterion defines the mobility of four-link closed chain mechanisms in relation to its link lengths. A simple assumptio
APA, Harvard, Vancouver, ISO, and other styles
7

Carvalho, Cássia Siman, and Luís Eduardo Moraes Sinésio. "FILMS FOR DIALOGUES AND REFLECTIONS WITH THE CONCEPTUAL BASES OF PROFESSIONAL AND TECHNOLOGICAL EDUCATION (EPT)." In Education and Innovation: New Perspectives for Teaching. Seven Editora, 2025. https://doi.org/10.56238/sevened2024.041-040.

Full text
Abstract:
This article presents the excerpt of a master's study, which aimed to investigate films for dialogues and reflections with the conceptual bases of Professional and Technological Education (EPT). The justification of the study was revealed in the perspective that the films can bring subsidies to teachers about the possibilities of teaching contents addressed in the classroom in dialogue with the conceptual bases of EFA. In the methodological path, the research was characterized as of an applied nature, of the exploratory type and from a qualitative approach, with the theoretical foundation base
APA, Harvard, Vancouver, ISO, and other styles
8

Davis, Jon, and Elizabeth Chang. "Optimized and Distributed Variant Logic for Model-Driven Applications." In Application Development and Design. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3422-8.ch044.

Full text
Abstract:
The customization of Enterprise Information Systems (EIS) is expensive throughout its lifecycle, especially across an enterprise-wide distributed application environment. The authors' ongoing development of a temporal meta-data framework for EIS applications seeks to minimize these issues with the application model supporting the capability for end users to define their own supplemental or alternate application logic as what they term Variant Logic (VL). VL can be applied to any existing model object, defined by any authorized user, through modeling rather than coding, then executed by any use
APA, Harvard, Vancouver, ISO, and other styles
9

Davis, Jon, and Elizabeth Chang. "Optimized and Distributed Variant Logic for Model-Driven Applications." In Handbook of Research on Innovations in Systems and Software Engineering. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-6359-6.ch018.

Full text
Abstract:
The customization of Enterprise Information Systems (EIS) is expensive throughout its lifecycle, especially across an enterprise-wide distributed application environment. The authors' ongoing development of a temporal meta-data framework for EIS applications seeks to minimize these issues with the application model supporting the capability for end users to define their own supplemental or alternate application logic as what they term Variant Logic (VL). VL can be applied to any existing model object, defined by any authorized user, through modeling rather than coding, then executed by any use
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Keun. "Economics of Technological Leapfrogging." In The Challenges of Technology and Economic Catch-up in Emerging Economies. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780192896049.003.0005.

Full text
Abstract:
Latecomer economies are firms which may be able to leapfrog older vintages of technology, and make pre-emptive investments in emerging technologies to catch up with advanced countries in new markets. Leapfrogging can be defined as latecomers trying something different ahead of the forerunners, thereby leaping over them. The answer to the question whether the fourth industrial revolution represents a new window of opportunity for leapfrogging or whether it constitutes a source of further risks for latecomers is that this depends entirely on the country’s response and readiness, that is, its ind
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Pre-defined path"

1

Ahmed, S. Towseef, Md Noorjahan, Syed Nishath Samreen, S. Saritha Kumari, and S. Fowzia Sultana. "Raspberry-Pi Based Semi-Autonomous Rover for Pre-Defined Navigation Path." In 2025 International Conference on Machine Learning and Autonomous Systems (ICMLAS). IEEE, 2025. https://doi.org/10.1109/icmlas64557.2025.10968070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Buchheit, R. G., F. D. Wall, G. E. Stoner, and J. P. Moran. "Stress Corrosion Cracking of Al-Li-Cu-Zr Alloy 2090 in Aqueous Cl− and Mixed CO32−/Cl− Environments." In CORROSION 1991. NACE International, 1991. https://doi.org/10.5006/c1991-91099.

Full text
Abstract:
Abstract A comparison of the short-tranverse SCC behavior of 2090 in pH 5.5 Cl− and alkaline CO32−/Cl− solutions using a static load smooth bar SCC technique was made. In the alkaline CO32−/Cl− solutions, Ebr for the α-Al matrix phase was 0.130 V more positive than the Ebr of the subgrain boundary T1 phase. In this environment, stress corrosion cracking test specimens subjected to potentials in the window defined by the two breakaway potentials failed along an intersubgranular path in less than an hour. In the Cl− environment, the Ebr values for the two phases were nearly equal and this rapid
APA, Harvard, Vancouver, ISO, and other styles
3

Gowsalyaa, M., R. Sabitha, and S. Karthik. "A survey on maximum data collection with a pre-defined path and distance allocation." In 2017 11th International Conference on Intelligent Systems and Control (ISCO). IEEE, 2017. http://dx.doi.org/10.1109/isco.2017.7856038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chiariotti, Federico, Stepan Kucera, Andrea Zanella, and Holger Claussen. "LEAP: A latency control protocol for multi-path data delivery with pre-defined QoS guarantees." In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2018. http://dx.doi.org/10.1109/infcomw.2018.8406904.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rocha, Lídia, and Kelen Vivaldini. "Comparison between Meta-Heuristic Algorithms for Path Planning." In VIII Workshop de Teses e Dissertações em Robótica/Concurso de Teses e Dissertações em Robótica. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/wtdr_ctdr.2020.14950.

Full text
Abstract:
Unmanned Aerial Vehicle (UAV) has been increasingly employed in several missions with a pre-defined path. Over the years, UAV has become necessary in complex environments, where it demands high computational cost and execution time for traditional algorithms. To solve this problem meta-heuristic algorithms are used. Meta-heuristics are generic algorithms to solve problems without having to describe each step until the result and search for the best possible answer in an acceptable computational time. The simulations are made in Python, with it, a statistical analyses was realized based on exec
APA, Harvard, Vancouver, ISO, and other styles
6

Alciatore, David G. "A Heuristic Application-Specific Path Planner for Robot Motion Planning." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0016.

Full text
Abstract:
Abstract This paper presents the development and simulation results of a Heuristic Application-Specific Path Planner (HASPP) that can be used to automatically plan trajectories for a manipulator operating around obstacles. Since the implementation of HASPP is inherently application-specific due to dependence on heuristics, the application of HASPP to an eight degree of freedom Pipe Manipulator is presented as an illustrative example. This development and simulation was implemented on a Silicon Graphics Personal IRIS with the aid of WALKTHRU, a 3-D simulation and animation tool, and software de
APA, Harvard, Vancouver, ISO, and other styles
7

Gasparetto, A., R. Vidoni, E. Saccavini, and D. Pillan. "Optimal Path Planning for Painting Robots." In ASME 2010 10th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2010. http://dx.doi.org/10.1115/esda2010-24259.

Full text
Abstract:
In this work, a robotic painting task is addressed in order to automate and improve the efficiency of the process. Usually, path planning in robotic painting is done through self learning programming. Recently, different automated and semi-automated systems have been developed in order to avoid this procedure by using a CAD-drawing to create a CAD-guided trajectory for the paint gun, or by acquiring and recognizing the overall shape of the object to be painted within a library of prestored shapes with associated pre-defined paths. However, a general solution is still lacking, which enables one
APA, Harvard, Vancouver, ISO, and other styles
8

Borguet, S., O. Léonard, and P. Dewallef. "Analysis Versus Synthesis for Trending of Gas-Path Measurement Time Series." In ASME Turbo Expo 2014: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-26029.

Full text
Abstract:
Gas-path measurements used to assess the health condition of an engine are corrupted by noise. Generally, a data cleaning step occurs before proceeding with fault detection and isolation. Classical linear filters such as the exponentially weighted moving average filter are traditionally used for noise removal. Unfortunately, these low-pass filters distort trend shifts indicative of faults, which increases the detection delay. The present paper investigates two new approaches to non-linear filtering of time series. On one hand, the synthesis approach reconstructs the signal as a combination of
APA, Harvard, Vancouver, ISO, and other styles
9

Hermes, Zainab, Ashraf O. Nassef, and Lotfi K. Gaafar. "Optimal Camera Path Planning for the Inspection of Printed Circuit Boards Using a Two Stepped Optimization Approach." In ASME 2010 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/detc2010-28393.

Full text
Abstract:
Automated Optical Inspection (AOI) systems are rapidly replacing slow and tedious manual inspections of Printed Circuit Boards (PCBs). In an AOI system, a minicamera traverses the PCB in a pre-defined travel path, snapping shots of all the PCB components or nodes, at pre-defined locations. The images are then processed and information about the different nodes is extracted and compared against ideal standards stored in the AOI system. This way, a flawed board is detected. Minimizing both the number of images required to scan all the PCB nodes, and the path through which the camera must travel
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, J., A. de Sam Lazaro, and L. A. Kendall. "Computer Representation of the Machining Environment." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0129.

Full text
Abstract:
Abstract Machining is an operation which utilizes both deterministic and heuristic inputs. Quantitative and qualitative judgments are made in order to optimize the process. Geometry, tool path control and so on are generally pre-defined whereas machining parameters such as cutting speed, feed rate and depth of cut require both mathematical and intuitive analyses to produce the best results. Computer representation of the machining environment requires both mathematical and heuristic models. A hybrid model for machining is presented and discussed. The model is simulated experimentally in an int
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Pre-defined path' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography