Добірка наукової літератури з теми "Trajectory search"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Trajectory search".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Trajectory search"
Xie, Dong, Feifei Li, and Jeff M. Phillips. "Distributed trajectory similarity search." Proceedings of the VLDB Endowment 10, no. 11 (August 2017): 1478–89. http://dx.doi.org/10.14778/3137628.3137655.
Повний текст джерелаTedjopurnomo, David Alexander, Xiucheng Li, Zhifeng Bao, Gao Cong, Farhana Choudhury, and A. K. Qin. "Similar Trajectory Search with Spatio-Temporal Deep Representation Learning." ACM Transactions on Intelligent Systems and Technology 12, no. 6 (December 31, 2021): 1–26. http://dx.doi.org/10.1145/3466687.
Повний текст джерелаShao, Xiao Fang, and Hong Chen. "Directional Search for Spiral Trajectory Extraction." Applied Mechanics and Materials 713-715 (January 2015): 577–80. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.577.
Повний текст джерелаChen, Wei, Lei Zhao, Jia-Jie Xu, Guan-Feng Liu, Kai Zheng, and Xiaofang Zhou. "Trip Oriented Search on Activity Trajectory." Journal of Computer Science and Technology 30, no. 4 (July 2015): 745–61. http://dx.doi.org/10.1007/s11390-015-1558-6.
Повний текст джерелаChen, Mingming, Ning Wang, Guofeng Lin, and Jedi S. Shang. "Network-Based Trajectory Search over Time Intervals." Big Data Research 25 (July 2021): 100221. http://dx.doi.org/10.1016/j.bdr.2021.100221.
Повний текст джерелаQi, Shuyao, Dimitris Sacharidis, Panagiotis Bouros, and Nikos Mamoulis. "Snapshot and continuous points-based trajectory search." GeoInformatica 21, no. 4 (August 17, 2016): 669–701. http://dx.doi.org/10.1007/s10707-016-0267-9.
Повний текст джерелаZhao, Peng, Weixiong Rao, Chengxi Zhang, Gong Su, and Qi Zhang. "SST: Synchronized Spatial-Temporal Trajectory Similarity Search." GeoInformatica 24, no. 4 (April 28, 2020): 777–800. http://dx.doi.org/10.1007/s10707-020-00405-y.
Повний текст джерелаWang, Hongzhi, and Amina Belhassena. "Parallel trajectory search based on distributed index." Information Sciences 388-389 (May 2017): 62–83. http://dx.doi.org/10.1016/j.ins.2017.01.016.
Повний текст джерелаPsiaki, M. L., and K. H. Park. "Parallel solver for trajectory optimization search directions." Journal of Optimization Theory and Applications 73, no. 3 (June 1992): 519–46. http://dx.doi.org/10.1007/bf00940054.
Повний текст джерелаAlexandropoulos, Stamatios-Aggelos N., Panos M. Pardalos, and Michael N. Vrahatis. "Dynamic search trajectory methods for global optimization." Annals of Mathematics and Artificial Intelligence 88, no. 1-3 (August 27, 2019): 3–37. http://dx.doi.org/10.1007/s10472-019-09661-7.
Повний текст джерелаДисертації з теми "Trajectory search"
Niiya, Craig K. (Craig Koji). "An application of the A* search to trajectory optimization." Thesis, Massachusetts Institute of Technology, 1990. http://hdl.handle.net/1721.1/42444.
Повний текст джерелаTitle as it appears in the M.I.T. Graduate List, June, 1990: An application of the A* search technique to trajectory optimization.
Includes bibliographical references (leaves 87-88).
by Craig K. Niiya.
M.S.
Tejedor, Vincent. "Random walks and first-passage properties : trajectory analysis and search optimization." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2012. http://tel.archives-ouvertes.fr/tel-00721294.
Повний текст джерелаGois, Francisco Nauber Bernardo. "Search-based stress test : an approach applying evolutionary algorithms and trajectory methods." Universidade de Fortaleza, 2017. http://dspace.unifor.br/handle/tede/103338.
Повний текст джерелаSome software systems must respond to thousands or millions of concurrent requests. These systems must be properly tested to ensure that they can function correctly under the expected load. Performance degradation and consequent system failures usually arise in stressed conditions. Stress testing subjects the program to heavy loads. Stress tests di¿er from other kinds of testing in that the system is executed on its breakpoints, forcing the application or the supporting infrastructure to fail. The search for the longest execution time is seen as a discontinuous, nonlinear, optimization problem, with the input domain of the system under test as a search space. In this context, search-based testing is viewed as a promising approach to verify timing constraints. Search-based software testing is the application of metaheuristic search techniques to generate software tests. The test adequacy criterion is transformed into a ¿tness function and a set of solutions in the search space is evaluated with respect to the ¿tness functionusingametaheuristic. Search-basedstresstestinginvolves¿ndingthebest-andworst-case executiontimestoascertainwhethertimingconstraintsareful¿lled. ServiceLevelAgreements (SLAs) are documents that specify realistic performance guarantees as well as penalties for non-compliance. SLAsaremadebetweenprovidersandcustomersthatincludeservicequality, resourcescapability,scalability,obligations,andconsequencesincaseofviolations. Satisfying SLAisofgreatimportanceandachallengingissue. Themainmotivationofthisthesisisto¿nd theadequateresponsetimeofSLAsusingStressTesting. Thisthesisaddressesthreeapproaches insearch-basedstresstests. First,HybridmetaheuristicusesTabuSearch,SimulatedAnnealing, andGeneticAlgorithmsinacollaborativemanner. Second,anapproachcalledHybridQusesa reinforcementlearningtechniquetooptimizethechoiceofneighboringsolutionstoexplore,reducingthetimeneededtoobtainthescenarioswiththelongestresponsetimeintheapplication. The best solutions found by HybridQ were on average 5.98% better that achieved by the Hybrid approach without Q-learning. Third, the thesis investigates the use of the multi-objective NSGA-II,SPEA2,PAESandMOEA/Dalgorithms. MOEA/Dmetaheuristicsobtainedthebest hypervolume value when compared with other approaches. The collaborative approach using MOEA/D and HybridQ improves the hypervolume values obtained and found more relevant workloadsthanthepreviousexperiments. AtoolnamedIAdapter,aJMeterpluginforperformingsearch-basedstresstests,wasdevelopedandusedtoconductalltheexperiments. Keywords: Search-based Testing, Stress Testing, Multi-objective metaheuristics, Hybrid metaheuristics,ReinforcementLearning.
Alguns sistemas de software devem responder a milhares ou milhões de requisições simultâneos. Tais sistemas devem ser devidamente testados para garantir que eles possam funcionar corretamente sob uma carga esperada. Normalmente, a degradação do desempenho e consequentes falhas do sistema geralmente ocorrem em condições de estresse. No teste de estresse o sistema é submetido a cargas de trabalho acima dos resquistos não funcionais estabelecidos. Os testes de estresse diferem de outros tipos de testes em que o sistema é executado em seus pontos de interrupção, forçando o aplicativo ou a infra-estrutura de suporte a falhar. Testes de estresse podem ser vistos como um problema de otimização descontínuo, não-linear, comodomínio de entrada do sistema em test ecomo espaço de busca. Neste contexto,ostestes baseados em busca (search-based tests) são vistos como uma abordagem promissora para veri¿car as restrições de tempo. O teste de software baseado em busca é a aplicação de técnicas de pesquisa metaheurística para gerar testes de software. O critério de adequação do teste é transformado em uma função objetivo e um conjunto de soluções no espaço de busca é avaliado em relação à função objetivo usando uma metaheurística. Otestedeestressebaseadoembusca envolve encontrar os tempos de execução melhores e piores para veri¿car se as restrições de tempo são cumpridas. Os acordos de nível de serviço (SLA) são documentos que especi¿cam garantias de desempenho realistas, bem como penalidades por incumprimento. Os SLAs são feitos entre provedores e clientes que incluem qualidade do serviço, capacidade de recursos, escalabilidade, obrigações e consequencias em caso de violação. Satisfazer o SLA é de grande importância e um problema desa¿ador. A principal motivação desta tese é encontrar o tempo de resposta adequado dos SLAs usando teste de estresse. Esta tese apresenta três abordagens em testes de estresse baseados em busca. Primeiro, a metaheurística híbrida usa Tabu Search, Simulated Annealing e Algoritmos Genéticos de forma colaborativa. Em segundo lugar, uma abordagem chamada HybridQ usa uma técnica de aprendizado de reforço para otimizar a escolha de soluções vizinhas para explorar, reduzindo o tempo necessário para obter os cenários com o tempo de resposta mais longo na aplicação. As melhores soluções encontradas pelo HybridQ foram em média 5,98 % melhores que alcançadas pela abordagem híbrida sem Qlearning. Em terceiro lugar, a tese investiga o uso dos algoritmos multi-objetivos NSGA-II, SPEA2, PAES e MOEA/D. A metaheurística MOEA/D obteve o melhor valor de hipervolume quando comparada com outras abordagens. A abordagem colaborativa usand oMOEA/DeHybridQ melhora os valores de hipervolume obtidos e encontrou workloads mais relevantes do que as experiências anteriores. Uma ferramenta chamada IAdapter, um plugin JMeter para realizar testes de esforço baseados em busca, foi desenvolvida e usada para realizar todas as experiências. Palavras-chave: Search-basedTesting,StressTesting,Multi-objective metaheuristics,Hybridmetaheuristics,ReinforcementLearning
Bykov, Yuri. "Time-predefined and trajectory-based search : single and multiobjective approaches to exam timetabling." Thesis, University of Nottingham, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289449.
Повний текст джерелаBilal, Mohd. "A Heuristic Search Algorithm for Asteroid Tour Missions." Thesis, Luleå tekniska universitet, Rymdteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-71361.
Повний текст джерелаGu, Tianyu. "Improved Trajectory Planning for On-Road Self-Driving Vehicles Via Combined Graph Search, Optimization & Topology Analysis." Research Showcase @ CMU, 2017. http://repository.cmu.edu/dissertations/794.
Повний текст джерелаVerkuil, Robert(Robert H. ). "Applicability of deep learning approaches to non-convex optimization for trajectory-based policy search." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/121761.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 75-76).
Trajectory optimization is a powerful tool for determining good control sequences for actuating dynamical systems. In the past decade, trajectory optimization has been successfully used to train and guide policy search within deep neural networks via optimizing over many trajectories simultaneously, subject to a shared neural network policy constraint. This thesis seeks to understand how this specific formulation converges in comparison to known globally optimal policies for simple classical control systems. To do so, results from three lines of experimentation are presented. First, trajectory optimization control solutions are compared against globally optimal policies determined via value iteration on simple control tasks. Second, three systems built for parallelized, non-convex optimization across trajectories with a shared neural network constraint are described and analyzed. Finally, techniques from deep learning known to improve convergence speed and quality in non-convex optimization are studied when applied to both the shared neural networks and the trajectories used to train them.
by Robert Verkuil.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Raquet, John F. (John Foster). "Six degree of freedom trajectory planner for spacecraft proximity operations using an A* node search." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/17287.
Повний текст джерелаFang, Zhicheng. "Trajectory-based systematic framework for obtaining sub-paths." Thesis, Queensland University of Technology, 2022. https://eprints.qut.edu.au/232642/1/Zhicheng_Fang_Thesis.pdf.
Повний текст джерелаKimball, Nicholas. "Utilizing Trajectory Optimization In The Training Of Neural Network Controllers." DigitalCommons@CalPoly, 2019. https://digitalcommons.calpoly.edu/theses/2071.
Повний текст джерелаКниги з теми "Trajectory search"
McCray, Ken, and KDC Publishing. In Search of a Faith Mentor: The Discovery Will Change the Trajectory and Quality of Your Life. KDC Enterprises LLC, 2022.
Знайти повний текст джерелаTrencsényi, Balázs, Michal Kopeček, Luka Lisjak Gabrijelčič, Maria Falina, Mónika Baár, and Maciej Janowski. In Search of a New Ideology. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198829607.003.0006.
Повний текст джерелаUnited States. National Aeronautics and Space Administration., ed. A six degree of freedom, plume-fuel optimal trajectory planner for spacecraft proximity operations using an A* node search. Cambridge, Mass: Charles Stark Draper Laboratory, Inc., 1994.
Знайти повний текст джерелаFaiz, Asma. In Search of Lost Glory. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780197567135.001.0001.
Повний текст джерелаHilliard, Kathleen. Finding Slave Voices. Edited by Mark M. Smith and Robert L. Paquette. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199227990.013.0032.
Повний текст джерелаHughes, Christopher W. Japan’s Remilitarization and Constitutional Revision. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252037894.003.0007.
Повний текст джерелаMukherjee, Supriya. Indian Historical Writing since 1947. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199225996.003.0026.
Повний текст джерелаGunter, Barrie. The Study of Online Relationships and Dating. Edited by William H. Dutton. Oxford University Press, 2013. http://dx.doi.org/10.1093/oxfordhb/9780199589074.013.0009.
Повний текст джерелаZhou, Taomo. Migration in the Time of Revolution. Cornell University Press, 2019. http://dx.doi.org/10.7591/cornell/9781501739934.001.0001.
Повний текст джерелаЧастини книг з теми "Trajectory search"
Qi, Shuyao, Panagiotis Bouros, Dimitris Sacharidis, and Nikos Mamoulis. "Efficient Point-Based Trajectory Search." In Advances in Spatial and Temporal Databases, 179–96. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22363-6_10.
Повний текст джерелаChen, Wei, Lei Zhao, Xu Jiajie, Kai Zheng, and Xiaofang Zhou. "Ranking Based Activity Trajectory Search." In Web Information Systems Engineering – WISE 2014, 170–85. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11749-2_14.
Повний текст джерелаMa, Xiang, Xu Chen, Ashfaq Khokhar, and Dan Schonfeld. "Motion Trajectory-Based Video Retrieval, Classification, and Summarization." In Video Search and Mining, 53–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12900-1_3.
Повний текст джерелаLee, Ki-Young, Chae-Hun Lim, Jeong-Joon Kim, Sun-Jin Oh, and Jeong-Jin Kang. "Similar Trajectory Search for Video Data." In Communications in Computer and Information Science, 222–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35600-1_33.
Повний текст джерелаGuo, Kaiyang, Rong-Hua Li, Shaojie Qiao, Zhenjun Li, Weipeng Zhang, and Minhua Lu. "Efficient Order-Sensitive Activity Trajectory Search." In Lecture Notes in Computer Science, 391–405. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68783-4_27.
Повний текст джерелаBroilo, Mattia, Nicola Piotto, Giulia Boato, Nicola Conci, and Francesco G. B. De Natale. "Object Trajectory Analysis in Video Indexing and Retrieval Applications." In Video Search and Mining, 3–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12900-1_1.
Повний текст джерелаAnjum, Nadeem, and Andrea Cavallaro. "Trajectory Clustering for Scene Context Learning and Outlier Detection." In Video Search and Mining, 33–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12900-1_2.
Повний текст джерелаZheng, Jianbing, Shuai Wang, Cheqing Jin, Ming Gao, Aoying Zhou, and Liang Ni. "Trajectory Similarity Search with Multi-level Semantics." In Algorithms and Architectures for Parallel Processing, 602–19. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95391-1_38.
Повний текст джерелаTao, Jiachun, Zhicheng Pan, Junhua Fang, Pingfu Chao, Pengpeng Zhao, and Jiajie Xu. "Misty: Microservice-Based Streaming Trajectory Similarity Search." In Service-Oriented Computing, 155–70. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-20984-0_11.
Повний текст джерелаTangpattanakul, Panwadee, Anupap Meesomboon, and Pramin Artrit. "Optimal Trajectory of Robot Manipulator Using Harmony Search Algorithms." In Recent Advances In Harmony Search Algorithm, 23–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-04317-8_3.
Повний текст джерелаТези доповідей конференцій з теми "Trajectory search"
Amini, Shahriyar, A. J. Brush, John Krumm, Jaime Teevan, and Amy Karlson. "Trajectory-aware mobile search." In the 2012 ACM annual conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2207676.2208644.
Повний текст джерелаPelekis, Nikos, Ioannis Kopanakis, Gerasimos Marketos, Irene Ntoutsi, Gennady Andrienko, and Yannis Theodoridis. "Similarity Search in Trajectory Databases." In 14th International Symposium on Temporal Representation and Reasoning (TIME'07). IEEE, 2007. http://dx.doi.org/10.1109/time.2007.59.
Повний текст джерелаWang, Haibo, and Kuien Liu. "User oriented trajectory similarity search." In the ACM SIGKDD International Workshop. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2346496.2346513.
Повний текст джерелаFrentzos, Elias, Kostas Gratsias, and Yannis Theodoridis. "Index-based Most Similar Trajectory Search." In 2007 IEEE 23rd International Conference on Data Engineering. IEEE, 2007. http://dx.doi.org/10.1109/icde.2007.367927.
Повний текст джерелаTiakas, Eleftherios, Apostolos Papadopoulos, Alexandros Nanopoulos, Yannis Manolopoulos, Dragan Stojanovic, and Slobodanka Djordjevic-Kajan. "Trajectory Similarity Search in Spatial Networks." In 2006 10th International Database Engineering and Applications Symposium (IDEAS'06). IEEE, 2006. http://dx.doi.org/10.1109/ideas.2006.48.
Повний текст джерелаLin-Yu Tseng and Chun Chen. "Multiple trajectory search for multiobjective optimization." In 2007 IEEE Congress on Evolutionary Computation. IEEE, 2007. http://dx.doi.org/10.1109/cec.2007.4424940.
Повний текст джерелаTeng, Yiping, Zhan Shi, Fanyou Zhao, Guohui Ding, Li Xu, and Chunlong Fan. "Signature-Based Secure Trajectory Similarity Search." In 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). IEEE, 2021. http://dx.doi.org/10.1109/trustcom53373.2021.00043.
Повний текст джерелаYin, Wenjin, Jingyuan Zhang, and Jitao Li. "The maneuver search and the maneuver search trajectory framework of search heavy torpedo." In Seventh International Symposium on Precision Mechanical Measurements, edited by Liandong Yu. SPIE, 2016. http://dx.doi.org/10.1117/12.2216374.
Повний текст джерелаZheng, Bolong, Nicholas Jing Yuan, Kai Zheng, Xing Xie, Shazia Sadiq, and Xiaofang Zhou. "Approximate keyword search in semantic trajectory database." In 2015 IEEE 31st International Conference on Data Engineering (ICDE). IEEE, 2015. http://dx.doi.org/10.1109/icde.2015.7113349.
Повний текст джерелаShang, Shuo, Ruogu Ding, Bo Yuan, Kexin Xie, Kai Zheng, and Panos Kalnis. "User oriented trajectory search for trip recommendation." In the 15th International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2247596.2247616.
Повний текст джерела