Log in

Relevant bibliographies by topics / FINDPATH

Contents

Journal articles
Books
Book chapters
Conference papers

Academic literature on the topic 'FINDPATH'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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 'FINDPATH.'

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 "FINDPATH"

1

Vanualailai, Jito, Jun-Hong Ha, and Shin-ichi Nakagiri. "A solution to the two-dimensional findpath problem." Dynamics and Stability of Systems 13, no. 4 (January 1998): 373–401. http://dx.doi.org/10.1080/02681119808806270.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sharma, B. "Solving the three-dimensional findpath problem via Liapunov's method." South Pacific Journal of Natural and Applied Sciences 20, no. 1 (2002): 48. http://dx.doi.org/10.1071/sp02010.

Full text

Abstract:

This paper presents a method for solving the findpath problem. Commonly known as the second or direct method of Liapunov, the method is used to solve this geometric problem of finding collision-free trajectories of moving solid objects amongst other fixed and moving solid objects. A Liapunov function is proposed for a n-point dynamical system in three-space. Computer simulations are carried out to show the effectiveness of the proposed Liapunov function-based feedback controllers.

APA, Harvard, Vancouver, ISO, and other styles

3

Ha, Junhong, and Jaedong Shim. "A findpath problem in the presence of moving obstacles." Korean Journal of Computational & Applied Mathematics 7, no. 1 (January 2000): 125–37. http://dx.doi.org/10.1007/bf03009932.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brooks, Rodney A., and Tomas Lozano-Perez. "A subdivision algorithm in configuration space for findpath with rotation." IEEE Transactions on Systems, Man, and Cybernetics SMC-15, no. 2 (March 1985): 224–33. http://dx.doi.org/10.1109/tsmc.1985.6313352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zelinsky, Alexander. "Using Path Transforms to Guide the Search for Findpath in 2D." International Journal of Robotics Research 13, no. 4 (August 1994): 315–25. http://dx.doi.org/10.1177/027836499401300403.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Nearchou, Andreas C. "Path planning of a mobile robot using genetic heuristics." Robotica 16, no. 5 (September 1998): 575–88. http://dx.doi.org/10.1017/s0263574798000289.

Full text

Abstract:

A genetic algorithm for the path planning problem of a mobile robot which is moving and picking up loads on its way is presented. Assuming a findpath problem in a graph, the proposed algorithm determines a near-optimal path solution using a bit-string encoding of selected graph vertices. Several simulation results of specific task-oriented variants of the basic path planning problem using the proposed genetic algorithm are provided. The results obtained are compared with ones yielded by hill-climbing and simulated annealing techniques, showing a higher or at least equally well performance for the genetic algorithm.

APA, Harvard, Vancouver, ISO, and other styles

7

Vieira, Gilles, Marc Carnicer, Jean-Charles Portais, and Stéphanie Heux. "FindPath: a Matlab solution for in silico design of synthetic metabolic pathways." Bioinformatics 30, no. 20 (June 3, 2014): 2986–88. http://dx.doi.org/10.1093/bioinformatics/btu422.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bhattacharya, B. K., and J. Zorbas. "Solving the two-dimensional findpath problem using a line-triangle representation of the robot." Journal of Algorithms 9, no. 4 (December 1988): 449–69. http://dx.doi.org/10.1016/0196-6774(88)90012-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Klowak, Jennifer Ann, Salhab el Helou, Jeffrey M. Pernica, Melissa J. Parker, Michael Surette, Hendrik Poinar, and Alison E. Fox-Robichaud. "Fast I(n)dentification of Pathogens in Neonates (FINDPATH-N): protocol for a prospective pilot cohort study of next-generation sequencing for pathogen identification in neonates with suspected sepsis." BMJ Paediatrics Open 4, no. 1 (April 2020): e000651. http://dx.doi.org/10.1136/bmjpo-2020-000651.

Full text

Abstract:

IntroductionSepsis is a major source of morbidity and mortality in neonates; however, identification of the causative pathogens is challenging. Many neonates have negative blood cultures despite clinical evidence of sepsis. Next-generation sequencing (NGS) is a high-throughput, parallel sequencing technique for DNA. Pathogen-targeted enrichment followed by NGS has the potential to be more sensitive and faster than current gold-standard blood culture. In this pilot study, we will test the feasibility and pathogen detection patterns of pathogen-targeted NGS in neonates with suspected sepsis. Additionally, the distribution and diagnostic accuracy of biomarkers cell-free DNA and protein C levels at two time points will be explored.Methods and analysisWe will conduct a prospective, pilot observational study. Neonates over 1 kg with suspected sepsis from a single tertiary care children’s hospital will be recruited for the study. Recruitment will be censored at 200 events or 6 months’ duration. Two blood study samples will be taken: the first simultaneous to the blood culture (time=0 hour, for NGS and biomarkers) via an exception to consent (deferred consent) and another 24 hours later after prospective consent (biomarkers only). Neonates will be adjudicated into those with clinical sepsis, culture-proven sepsis and without sepsis based on clinical criteria. Feasibility parameters (eg, recruitment) and NGS process time will be reported.For analysis, NGS results will be described in aggregate, compared with the simultaneous blood culture (sensitivity and specificity) and reviewed via expert panel for plausibility. Pilot data for biomarker distribution and diagnostic accuracy (sensitivity and specificity) for distinguishing between septic and non-septic neonates will be reported.Ethics and disseminationEthics approval has been granted by the Hamilton Integrated Research Ethics Board. We will seek publication of study results in peer-reviewed journals.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "FINDPATH"

1

Unobstructed shortest paths in polyhedral environments. Berlin: Springer-Verlag, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "FINDPATH"

1

"Two Voronoi-based techniques for FINDPATH." In Lecture Notes in Computer Science, 52–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17629-2_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

"Solution of the general instance of FINDPATH." In Lecture Notes in Computer Science, 19–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17629-2_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

"Solutions of two specific instances of FINDPATH." In Lecture Notes in Computer Science, 34–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-17629-2_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "FINDPATH"

1

Wang, Jim, Verlynda S. Dobbs, and Henry W. Davis. "Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics." In the 1990 ACM annual conference. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/100348.100359.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!