{"id":"https://openalex.org/W6965026647","doi":"https://doi.org/10.26190/unsworks/18437","title":"Concurrent dynamic programming for grid-based optimisation problems","display_name":"Concurrent dynamic programming for grid-based optimisation problems","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W6965026647","doi":"https://doi.org/10.26190/unsworks/18437"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/54961","doi":null,"is_oa":true,"landing_page_url":"http://handle.unsw.edu.au/1959.4/54961","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://handle.unsw.edu.au/1959.4/54961","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024918060","display_name":"Stephen Cossell","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Cossell, Stephen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5024918060"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot-motion-planning","display_name":"robot motion planning","score":0.9610000252723694},{"id":"https://openalex.org/keywords/multi-core-processors","display_name":"multi-core processors","score":0.8870000243186951},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6800000071525574},{"id":"https://openalex.org/keywords/graphics-processing-units","display_name":"graphics processing units","score":0.8460000157356262},{"id":"https://openalex.org/keywords/configuration-space","display_name":"configuration space","score":0.47099998593330383},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.531000018119812},{"id":"https://openalex.org/keywords/high-dimensional-configuration-space","display_name":"high-dimensional configuration space","score":0.781000018119812}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6419000029563904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6395000219345093},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5141000151634216},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.5126000046730042},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5121999979019165},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5059000253677368},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.49729999899864197},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.4496000111103058},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.43790000677108765},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.349700003862381},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.34459999203681946},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.30070000886917114},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.273499995470047},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26429998874664307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26339998841285706},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.26339998841285706},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2632000148296356},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/54961","doi":null,"is_oa":true,"landing_page_url":"http://handle.unsw.edu.au/1959.4/54961","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/54961","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/54961","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},{"id":"doi:10.26190/unsworks/18437","doi":"https://doi.org/10.26190/unsworks/18437","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/18437","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"}],"best_oa_location":{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/54961","doi":null,"is_oa":true,"landing_page_url":"http://handle.unsw.edu.au/1959.4/54961","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2025721810","https://openalex.org/W2182181874","https://openalex.org/W1483158333","https://openalex.org/W169648573","https://openalex.org/W198329551","https://openalex.org/W1523458998","https://openalex.org/W6925120798","https://openalex.org/W2909931947","https://openalex.org/W123042691","https://openalex.org/W1953003771"],"abstract_inverted_index":{"A":[0],"particular":[1,149],"class":[2,164],"of":[3,28,31,64,73,82,92,109,129,158,165,180,200,222,237,241,244,308,320,347],"optimisation":[4],"problems":[5,20],"can":[6,46,332],"be":[7,47,333],"solved":[8],"using":[9],"a":[10,29,37,43,89,162,197,220,269,284],"technique":[11,17],"known":[12],"as":[13,117,279,305,344],"dynamic":[14,65,93,167],"programming.":[15],"This":[16,76,132],"applies":[18],"to":[19,42,123,173,185,192,208,232,273,316,342],"that":[21,105,141,170,290,354],"have":[22,142],"many":[23],"possible":[24],"solutions,":[25],"each":[26,57],"consisting":[27],"number":[30],"individual":[32],"decision":[33,58],"points.":[34],"In":[35,60,100],"theory,":[36],"globally":[38],"optimal":[39,54,189],"solution":[40,191],"relative":[41,207],"given":[44],"metric":[45],"obtained":[48],"by":[49],"recursively":[50],"choosing":[51],"the":[52,71,79,102,106,145,181,209,227,235,238,242,275,280,292,306,309,325,337,345],"most":[53,228],"option":[55],"at":[56],"point.":[59],"practice,":[61],"however,":[62],"applications":[63],"programming":[66,94,168],"are":[67,171,205,215,265],"computationally":[68],"expensive":[69],"for":[70,95],"scale":[72,114,236],"real-world":[74],"domains.":[75],"thesis":[77,103,133,160],"examines":[78],"existing":[80,193],"array":[81],"robot":[83],"motion":[84],"planning":[85],"algorithms":[86,111,169,182,331],"and":[87,97,217,277,312],"applications,":[88],"core":[90,178],"application":[91],"ground":[96],"aerial":[98],"vehicles.":[99],"particular,":[101],"highlights":[104],"sequential":[107,194],"nature":[108],"traditional":[110,288],"does":[112],"not":[113],"in":[115,127,144,258,287,324,350,356],"practice":[116],"modern":[118,351],"central":[119],"processing":[120,138,153],"units":[121],"begin":[122],"reach":[124],"physical":[125],"limits":[126],"terms":[128],"computational":[130,198,293],"throughput.":[131],"then":[134],"outlines":[135],"current":[136],"parallel":[137],"unit":[139],"architectures":[140],"emerged":[143],"last":[146],"decade":[147],"with":[148,196,226,253,268],"focus":[150],"on":[151,234],"graphical":[152],"units.":[154],"The":[155,177,296],"main":[156,239],"contribution":[157],"this":[159],"is":[161,183,314],"new":[163],"concurrent":[166,303,330],"applicable":[172],"multi-core":[174],"processor":[175],"architectures.":[176],"mechanic":[179],"proven":[184],"generate":[186],"an":[187,301,318],"equally":[188],"global":[190],"algorithms,":[195],"complexity":[199,294],"O(n),":[201],"assuming":[202],"enough":[203],"cores":[204],"available":[206],"problem":[210,310],"size.":[211],"Various":[212],"implementation":[213,338],"flavours":[214],"developed":[216],"benchmarked":[218],"over":[219],"variety":[221],"two-dimensional":[223],"configuration":[224,263],"spaces,":[225],"efficient":[229],"being":[230],"able":[231,315],"plan":[233],"campus":[240],"University":[243],"New":[245],"South":[246],"Wales":[247],"(a":[248],"1000m":[249],"x":[250,255],"500m":[251],"area)":[252],"1m":[254,256],"resolution":[257],"sub-second":[259],"time.":[260],"Higher":[261],"dimensional":[262],"spaces":[264],"also":[266],"investigated":[267],"proof-of-concept":[270],"experiment":[271],"presented":[272,298,326],"assess":[274],"feasibility":[276],"performance":[278],"dimensionality":[281,307],"increases":[282,291,311],"---":[283],"factor":[285],"notorious":[286],"approaches":[289,353],"exponentially.":[295],"work":[297],"here":[299],"gains":[300],"increased":[302],"benefit":[304],"hence":[313],"perform":[317],"order":[319],"magnitude":[321],"more":[322,334],"efficiently":[323],"three-dimensional":[327],"experiments.":[328],"Designing":[329],"difficult,":[335],"but":[336],"benefits":[339],"will":[340],"continue":[341],"increase":[343],"level":[346],"parallelism":[348],"found":[349,355],"hardware":[352],"nature.":[357]},"counts_by_year":[],"updated_date":"2026-11-13T13:42:25.865203","created_date":"2025-10-10T00:00:00"}