Presentation on Monday, December 3rd: 6,7,11,12,17,19 Presentation order Wednesday December 5th: 1,2,3,4,5 Presentation on Monday December 10th: 8,9,14,15,16, Team #: team 1 members name: Hui Yang, Xi Huang, Xuan Mei Project title: Tic-Tac-Toe Game with arbitrary dimension implementing alpha-beta algorithm Relevent paper: Huang, T. (2001). Strategy game programming projects. Journal of Computing Sciences in Colleges, 16(4), 205-213. http://delivery.acm.org/10.1145/380000/378708/p205-huang.pdf? ip=169.234.30.142&acc=PUBLIC&CFID=207371996&CFTOKEN=19183299&__acm_ _=1353529093_48d42f44c2e53885fa7b782ff3ffeeb5 --------------------- Team #: 2 Members: Teague Bick, Bryan Cutler Project Title: Real-time Motion Planning with Dynamic Obstacles Paper: Real-time Motion Planning with Dynamic Obstacles, Jarad Cannon and Kevin Rose and Wheeler Ruml, Symposium on Combinatorial Search (SoCS) 2012 --------- ---------------------- Team #: 3 members name: Kuan-Hua Peng, Xiaoyu Ma, Li Sheng Project title: Distributed approach of Monte Carlo Go problem solving Paper 1: "Scalable Distributed Monte-Carlo Tree Search" SoCS 2011 Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa Paper 2: "Monte Carlo Go Has a Way to Go" AAAI 2006 Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura ---------- Team #4 Members name: Zachary Heilbron, Young-Seok Kim, Hossein Tajik Project title: Investigate Improvements in Relaxation-based Methods for Planning Problems. Paper 1: Avitan Gefen, Ronen Brafman, “Pruning Methods for Optimal Delete-Free Planning”, ICAPS 2012. Paper 2: Patrik Haslum,”Incremental Lower Bounds for Additive Cost Planning Problems”, ICAPS 2012. --- Team #: 5 members name: Wei Ping, Geng Ji, Anbang Xu Project title: Machine Learning in Search Problems paper 1: A Preliminary Evaluation of Machine Learning in Algorithm Selection for Search Problems. Lars Kotthoff, Ian P. Gent, Ian Miguel. SoCS 2011 --- Team #: 6 (presenting Monday the 3rd) members name: Khurram Faraaz, Andrew Maltun, Jonathen Kwok Project title: Perimeter Search Applications, Performance, and Characteristics paper 1: Bakhshandeh, Reza, Mehdi Samadi, Zohreh Azimifar, and Jonathan Schaeffer. "Degrees of separation in social networks." In Fourth Annual Symposium on Combinatorial Search. 2011. paper2: Manzini, Giovanni. "BIDA*: an improved perimeter search algorithm."Artificial Intelligence 75, no. 2 (1995): 347-360. ---- Team #: 7 members name: Neda Masoud, Anupam Srivastava Project title: Prediction of solution costs paper 1: L. Lelis , R. Stern , and S. J. Arfaee “Predicting Solution Cost with Conditional Probabilities”, Proceedings, The Fourth International Symposium on Combinatorial Search (SoCS-2011) Paper2: L. Lelis, S. Zilles, and R. Holte, “Improved Prediction of IDA*’s Performance via -Truncation, Proceedings”, The Fourth International Symposium on Combinatorial Search (SoCS-2011) --- Team 8: Pushkar D Gopalakrishna (49124608), Anirudh Ramesh Iyer (81368320), Shobhit NS (snandagu) Project Title: Optimization of A* algorithm in search trees using move pruning and partial expansion. Paper1 - Automatic Move Pruning in General Single-Player Games Authors - Neil Burch, Robert C. Holte Venue - SoCS 2011 Paper2 - Partial expansion a* with selective node generation Authors - Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Jonathan Schaeffer, Robert C. Holte Venue - SoCS 2012 ---- Team #: 9 members name: Venkata Sri Krishnakanth Pulla 95911880 Anupam Rastogi 15404752 Project title: Deadline-Aware Search Using On-Line Measures of Behavior – study and performance analysis paper 1: “Deadline-Aware Search Using On-Line Measures of Behavior”-Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml - SoCS 2011 paper2: Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A* with provable bounds on sub-optimality. In Proceedings of the Seventeenth Annual Conference on Neural Information Processing Systems (NIPS-03) ---- Team 11: Team members: Yifan Ying #52442257 Huaxiang Man #64444069 Xiaoyi Zhang #86049497 Project title: Comparison of the Performance of Different Game-Tree Pruning Algorithms Paper 1: Automatic Move Pruning in General Single-Player Games Neil Burch, Robert C. Holte The Fourth International Symposium on Combinatorial Search (SoCS-2011) Paper 2: A Review of Game-tree Pruning T.A. Marsland International Computer Chess Association Journal There --- ------ Group No: 12 Team Members: Surya Ravichandran, Tejas Patil, Udita Sharma Project Topic: "A Novel Technique for Compressing Pattern Databases in the Pancake Sorting Problems" Authors: Morteza Keshtkaran, Roohollah Taghizadeh and Koorush Ziarati (want to present December 5th) ---- ---Team 13 is 19 --- Team #: 14 members name: Lulu Zhang, Weizhe Ni Project title: A brief research on incremental ARA* paper 1: Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search Xiaoxun Sun, William Yeoh, Tansel Uras, Sven Koenig Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling ICAPS 2012 ---- Team #: 15 Members' Names: He Zheng (88525591) Mohaned Qunaibit (95044284) Robert Sy (31523872) Project Title: Improving heuristic planning and searching over difficult domains. Paper 1: (full citation) Adapting a Rapidly-Exploring Random Tree for Automated Planning Vidal Alcázar, Manuela Veloso, Daniel Borrajo from SoCS 2012 http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4021 Paper2:(full citation) Adding diversity to classical heuristic planning Carlos Linares López, Daniel Borrajo from SoCS 2010 http://www.aaai.org/ocs/index.php/SOCS/SOCS10/paper/view/2095 ---- Team #: 16 Members Name: Sairam Subramanian Gopal Bharath Ramanathan Arun Sankaranarayanan Project title: Impact of heuristic in measuring the search progress. Paper 1: Jordan T. Thayer, Roni Stern and Levi H. S. Lelis - 2012 - Are We There Yet?Estimating Search Progress - In Proceedings of the Fifth Annual Symposium on Combinatorial Search. Paper 2: Vidal Alcazar, Manuela Veloso and Daniel Borrajo - 2011 - Adapting a Rapidly-Exploring Random Tree for Automated Planning - In Proceedings of the Fifth Annual Symposium on Combinatorial Search. ----- Team #: 17 Memebers' Names: Daniel Blackburn, Matthew Chan, Sterling T. Pearson Project Title: Planning Optimization via Dimensionality and Bounds Paper 1: Path Planning with Adaptive Dimensionality Kalin Gochev, Benjamin Cohen, Jonathan Butzke, Alla Safonova, Maxim Likhachev Paper 2: Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces Juan Pablo Gonzalez, Maxim Likhachev ---- Team 19 Group members: Will Devanny, Weiwei Jiang Project paper: Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search SUN, X.; YEOH, W.; URAS, T.; KOENIG, S.. Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. International Conference on Automated Planning and Scheduling, North America, may. 2012. Available at: . Date accessed: 21 Nov. 2012.