Realtime, Parallel Heuristic Search
{'Code': '05020000', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'IIS', 'LongName': 'Div Of Information & Intelligent Systems'}}
{'SignBlockName': 'Maria Zemankova', 'PO_EMAI': None, 'PO_PHON': None}
Heuristic search is a fundamental problem solving method in artificial          intelligence.  Current algorithm such as A* and IDA*, however, do not           scale up to large problems, due to their focus on finding optimal               solutions.  Removing the optimality constraint should allow the                 development of heuristic search algorithms that can effectively solve           arbitrarily large problems.  The reason is that heuristic evaluation            functions capture the long-range strategic component of problem                 solutions, while the discrepancy between heuristic estimates and actual         costs is primarily a short-range or tactical phenomenon.  Thus, an              algorithm with a sufficiently wide search horizon should be able to cope        with error in the heuristic function.                                                                                                                           A two-pronged attach on this problem is proposed.  The first is the             development of real-time search algorithms that run in constant time and        can commit to actions based on limited information or computation.  The         second is the development of parallel search algorithms in an attempt to        significantly extend the search horizons achievable by such algorithms.         Parallel tree-search algorithms should generalize to arbitrary tree-            recursive programs, such as those generated by divide-and-conquer               algorithms.
{'FirstName': 'Richard', 'LastName': 'Korf', 'PI_MID_INIT': 'E', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Richard E Korf', 'EmailAddress': 'korf@cs.ucla.edu', 'NSF_ID': '000198328', 'StartDate': '07/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of California-Los Angeles', 'CityName': 'LOS ANGELES', 'ZipCode': '900244200', 'PhoneNumber': '3107940102', 'StreetAddress': '10889 WILSHIRE BLVD STE 700', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'California', 'StateCode': 'CA', 'CONGRESSDISTRICT': '36', 'CONGRESS_DISTRICT_ORG': 'CA36', 'ORG_UEI_NUM': 'RN64EPNH8JC6', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF CALIFORNIA, LOS ANGELES', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '6855', 'Text': 'INFORMATION & KNOWLEDGE MANAGE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8801939.xml'}