Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Chemin optimal")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 583

  • Page / 24
Export

Selection :

  • and

Plus court chemin avec contraintes d'horairesDESROSIERS, J; PELLETIER, P; SOUMIS, F et al.RAIRO. Recherche opérationnelle. 1983, Vol 17, Num 4, pp 357-377, issn 0399-0559Article

Optimal mechanism design for path generation and motions with reduced harmonic contentYUAN, Zhongfan; GILMARTIN, M. J; DOUGLAS, S. S et al.Journal of mechanical design (1990). 2004, Vol 126, Num 1, pp 191-196, issn 1050-0472, 6 p.Article

UEBER LAENGSTE WEGE UND KREISE IN GRAPHEN. = SUR LE CHEMIN LE PLUS LONG ET LE CERCLE LE PLUS LONG DANS LES GRAPHESSCHMITZ W.1975; R.C. SEMINAR. MAT. UNIV. PADOVA; ITAL.; DA. 1975; VOL. 53; PP. 97-103; BIBL. 7 REF.Article

Globally optimal paths in the nonclassical growth modelAMIR, R.International series in modern applied mathematics and computer science. 1989, Vol 22, pp 663-674, issn 0733-1932Article

A framework for reactive motion and sensing planning : A critical events-based approachMURRIETA-CID, R; SARMIENTO, A; MUPPIRALA, T et al.Lecture notes in computer science. 2005, pp 990-1000, issn 0302-9743, isbn 3-540-29896-7, 1Vol, 11 p.Conference Paper

DETERMINATION DES CHEMINS EXTREMAUX ET ADMISSIBLES SUR LES GRAPHES ORIENTES PAR LA METHODE DE SIMULATION ELECTRONIQUEPROZOROV S JE.1972; DOP. AKAD. NAUK U.R.S.R., A; S.S.S.R.; DA. 1972; VOL. 34; NO 6; PP. 542-545; ABS. ANGL.; BIBL. 5 REF.Serial Issue

FINDING MINIMUM RECTILINEAR DISTANCE PATHS IN THE PRESENCE OF BARRIERSLARSON RC; LI VOK.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 3; PP. 285-304; BIBL. 9 REF.Article

PROBLEMES DE CHEMINS EXTREMAUX DANS LES GRAPHES ET LES RESEAUXSYSLO MM.1975; ARCH. AUTOMAT. TELEMECH.; POLSKA; DA. 1975; VOL. 20; NO 3; PP. 287-300; ABS. ANGL.; BIBL. 1 P. 1/2Article

PROBLEMES DE LA THEORIE DE L'ORDONNANCEMENT DANS LE TRANSPORT ET ALGORITHMES DE RESOLUTIONIGUDIN RV.1975; EKON. MAT. METODY; S.S.S.R.; DA. 1975; VOL. 11; NO 3; PP. 491-499; BIBL. 4 REF.Article

UN ALGORITHME DE RESOLUTION D'UN PROBLEME DE CHEMIN MINIMAL A TERMINAUX MULTIPLES DANS UN RESEAU GENERALISEANDRAS B.1975; ALKALMAZOTT MAT. LAPOK; MAGYAR.; DA. 1975; NO 1-2; PP. 109-115; ABS. ANGL.; BIBL. 16 REF.Article

THE TRANSPORTATION PARADOXSZWARC W.1971; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1971; VOL. 18; NO 2; PP. 185-202; BIBL. 5 REF.Serial Issue

Path feasibility and modification based on the PUMA 560 workspace analysisKUO-CHAING SHAO; KUU-YOUNG YOUNG.Journal of mechanical design (1990). 1994, Vol 116, Num 1, pp 36-43, issn 1050-0472Article

A simple variational problem for a moving vehicleSEONG-IN KIM; IN-CHAN CHOI.Operations research letters. 1994, Vol 16, Num 4, pp 231-239, issn 0167-6377Article

Enumeration of minimal paths of modified networksNAHMAN, J. M.Microelectronics and reliability. 1994, Vol 34, Num 3, pp 475-484, issn 0026-2714Article

Optimal paths and the prehistory problem for large fluctuations in noise-driven systemsDYKMAN, M. I; MCCLINTOCK, P. V. E; SMELYANSKI, V. N et al.Physical review letters. 1992, Vol 68, Num 18, pp 2718-2721, issn 0031-9007Article

Optimierung der Verfahrparameter von Industrieroboter-Steuerungen = Optimization of robot path planning parameters used in commercially available robot controllersKEMPKENS, K.Robotersysteme. 1990, Vol 6, Num 3, pp 145-151, issn 0178-0026, 7 p.Article

Optimal collision free path planning for non-synchronized motionsSTIFTER, S.Journal of intelligent & robotic systems. 1997, Vol 19, Num 2, pp 187-205, issn 0921-0296Article

Implementation of a genetic algorithm for routing an autonomous robotWIDE, P; SCHELLWAT, H.Robotica (Cambridge. Print). 1997, Vol 15, pp 207-211, issn 0263-5747, 2Article

An algorithm for finding a region with the minimum total L1from prescribed terminalsKUSAKARI, Y; NISHIZEKI, T.Lecture notes in computer science. 1997, pp 324-333, issn 0302-9743, isbn 3-540-63890-3Conference Paper

Interference-free insertion of a solid body into a cavity : An algorithm and a medical applicationJOSKOWICZ, L; TAYLOR, R. H.The International journal of robotics research. 1996, Vol 15, Num 3, pp 211-229, issn 0278-3649Article

Optimum motion planning in joint space for robots using genetic algorithmsYUN, W.-M; XI, Y.-G.Robotics and autonomous systems. 1996, Vol 18, Num 4, pp 373-393, issn 0921-8890Article

An approach to evaluating system well-being in engineering reliability applicationsBILLINTON, R; MAHMUD FOTUHI-FIRUZABAD; SALEH ABORESHAID et al.Reliability engineering & systems safety. 1995, Vol 50, Num 1, pp 1-5, issn 0951-8320Article

Time-optimal paths for high-speed maneuveringREISTER, D. B; LENHART, S. M.The International journal of robotics research. 1995, Vol 14, Num 2, pp 184-194, issn 0278-3649Article

Arm path planning of a space robot with angular momentumYAMADA, K; YOSHIKAWA, S; FUJITA, Y et al.Advanced robotics. 1995, Vol 9, Num 6, pp 693-709, issn 0169-1864Article

A depth-first search routing algorithm for star graphs and its performance evaluationSUR, S; SRIMANI, P. K.Mathematical and computer modelling. 1994, Vol 19, Num 9, pp 35-52, issn 0895-7177Article

  • Page / 24