{"id":"https://openalex.org/W4388692086","doi":"https://doi.org/10.1109/tase.2023.3330371","title":"A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints","display_name":"A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints","publication_year":2023,"publication_date":"2023-11-15","ids":{"openalex":"https://openalex.org/W4388692086","doi":"https://doi.org/10.1109/tase.2023.3330371"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2023.3330371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2023.3330371","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/ca439398-d569-4cd1-84dc-f57c491b04d3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012694169","display_name":"Enrico Ferrentino","orcid":"https://orcid.org/0000-0003-0768-8541"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Ferrentino","raw_affiliation_strings":["Department of Computer and Electrical Engineering and Applied Mathematics (DIEM), University of Salerno, Salerno, Fisciano, Italy"],"raw_orcid":"https://orcid.org/0000-0003-0768-8541","affiliations":[{"raw_affiliation_string":"Department of Computer and Electrical Engineering and Applied Mathematics (DIEM), University of Salerno, Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042766025","display_name":"Heitor J. Savino","orcid":"https://orcid.org/0000-0001-6975-0270"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heitor J. Savino","raw_affiliation_strings":["Ambev Robotics Laboratory, Anheuser-Busch InBev, Jacare&#x00ED;, S\u00e3o Paulo, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ambev Robotics Laboratory, Anheuser-Busch InBev, Jacare&#x00ED;, S\u00e3o Paulo, Brazil","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001771133","display_name":"Antonio Franchi","orcid":"https://orcid.org/0000-0002-5670-1282"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]},{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["IT","NL"],"is_corresponding":false,"raw_author_name":"Antonio Franchi","raw_affiliation_strings":["Robotics and Mechatronics Laboratory, Faculty of Electrical Engineering, Mathematics &#x0026; Computer Science, University of Twente, Enschede, The Netherlands","Department of Computer, Control and Management Engineering, Sapienza University of Rome, Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-5670-1282","affiliations":[{"raw_affiliation_string":"Robotics and Mechatronics Laboratory, Faculty of Electrical Engineering, Mathematics &#x0026; Computer Science, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Department of Computer, Control and Management Engineering, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085445088","display_name":"Pasquale Chiacchio","orcid":"https://orcid.org/0000-0003-3385-8866"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pasquale Chiacchio","raw_affiliation_strings":["Department of Computer and Electrical Engineering and Applied Mathematics (DIEM), University of Salerno, Salerno, Fisciano, Italy"],"raw_orcid":"https://orcid.org/0000-0003-3385-8866","affiliations":[{"raw_affiliation_string":"Department of Computer and Electrical Engineering and Applied Mathematics (DIEM), University of Salerno, Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1302,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92107068,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"4","first_page":"6744","last_page":"6757"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9998000264167786,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9998000264167786,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.754562258720398},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6178033947944641},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5744134187698364},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5368701815605164},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4610641896724701},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.3778686225414276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20486226677894592},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.17427286505699158},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1472007930278778}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.754562258720398},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6178033947944641},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5744134187698364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5368701815605164},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4610641896724701},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3778686225414276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20486226677894592},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.17427286505699158},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1472007930278778}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tase.2023.3330371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2023.3330371","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/ca439398-d569-4cd1-84dc-f57c491b04d3","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/ca439398-d569-4cd1-84dc-f57c491b04d3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ferrentino, E, Savino, H J, Franchi, A & Chiacchio, P 2023, 'A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints', IEEE transactions on automation science and engineering, pp. 1-14. https://doi.org/10.1109/TASE.2023.3330371","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:openaire/ca439398-d569-4cd1-84dc-f57c491b04d3","is_oa":true,"landing_page_url":"https://research.utwente.nl/files/328327609/A_Dynamic_Programming_Framework_for_Optimal_Planning_of_Redundant_Robots_Along_Prescribed_Paths_With_Kineto-Dynamic_Constraints.pdf","pdf_url":"https://ris.utwente.nl/ws/files/328327609/A_Dynamic_Programming_Framework_for_Optimal_Planning_of_Redundant_Robots_Along_Prescribed_Paths_With_Kineto-Dynamic_Constraints.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ferrentino, E, Savino, H J, Franchi, A & Chiacchio, P 2023, 'A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints', IEEE transactions on automation science and engineering, pp. 1-14. https://doi.org/10.1109/TASE.2023.3330371","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1729540","is_oa":false,"landing_page_url":"https://hdl.handle.net/11573/1729540","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/ca439398-d569-4cd1-84dc-f57c491b04d3","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/ca439398-d569-4cd1-84dc-f57c491b04d3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ferrentino, E, Savino, H J, Franchi, A & Chiacchio, P 2023, 'A Dynamic Programming Framework for Optimal Planning of Redundant Robots Along Prescribed Paths With Kineto-Dynamic Constraints', IEEE transactions on automation science and engineering, pp. 1-14. https://doi.org/10.1109/TASE.2023.3330371","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W46565623","https://openalex.org/W163118142","https://openalex.org/W1812725727","https://openalex.org/W1970412155","https://openalex.org/W1972394793","https://openalex.org/W1986104392","https://openalex.org/W1997430343","https://openalex.org/W2004026564","https://openalex.org/W2018831824","https://openalex.org/W2019745980","https://openalex.org/W2045874040","https://openalex.org/W2057781325","https://openalex.org/W2071146130","https://openalex.org/W2076569715","https://openalex.org/W2087149139","https://openalex.org/W2098934052","https://openalex.org/W2099114380","https://openalex.org/W2111210154","https://openalex.org/W2111632295","https://openalex.org/W2115091574","https://openalex.org/W2117129061","https://openalex.org/W2135347295","https://openalex.org/W2141620905","https://openalex.org/W2142629953","https://openalex.org/W2142981033","https://openalex.org/W2143804149","https://openalex.org/W2155612543","https://openalex.org/W2171028496","https://openalex.org/W2498850442","https://openalex.org/W2514982972","https://openalex.org/W2521872104","https://openalex.org/W2567909802","https://openalex.org/W2606548979","https://openalex.org/W2765628088","https://openalex.org/W2784320602","https://openalex.org/W2811423045","https://openalex.org/W2848484256","https://openalex.org/W2902825402","https://openalex.org/W2921328390","https://openalex.org/W2964222556","https://openalex.org/W2975660477","https://openalex.org/W2980689183","https://openalex.org/W2986280018","https://openalex.org/W3003902367","https://openalex.org/W3104826626","https://openalex.org/W3177611239","https://openalex.org/W3178511394","https://openalex.org/W3205902127","https://openalex.org/W4206272495","https://openalex.org/W4211171308","https://openalex.org/W4220672823","https://openalex.org/W4225390809","https://openalex.org/W4226516300","https://openalex.org/W4285739762","https://openalex.org/W4321794973","https://openalex.org/W4324095036","https://openalex.org/W4378555615","https://openalex.org/W4384787630","https://openalex.org/W4386160136","https://openalex.org/W4387914412","https://openalex.org/W6903373631"],"related_works":["https://openalex.org/W1982160337","https://openalex.org/W1971380437","https://openalex.org/W1983548084","https://openalex.org/W2141691317","https://openalex.org/W2110846987","https://openalex.org/W2160609742","https://openalex.org/W2979526210","https://openalex.org/W1997414638","https://openalex.org/W2031091109","https://openalex.org/W814774360"],"abstract_inverted_index":{"Offline":[0],"optimal":[1,91,147,477],"planning":[2,92,134,170,193,257,357,369,446,489],"of":[3,93,123,139,145,293,320,339,368,474,480,487],"trajectories":[4,125,175,202],"for":[5,90,109,200,203,228,335,412,419,468],"redundant":[6,218],"robots":[7,205,229],"along":[8],"prescribed":[9],"task":[10,23,254],"space":[11,24,32,481],"paths":[12],"is":[13,26,37,66,71,107,156,221,289,333,403,416],"usually":[14],"broken":[15],"down":[16],"into":[17],"two":[18,45],"consecutive":[19],"processes:":[20],"first,":[21],"the":[22,35,44,52,72,105,121,137,146,153,165,198,212,239,243,249,253,269,283,318,321,330,340,347,351,365,392,400,423,432,445,456,465,470],"path":[25,251],"inverted":[27],"to":[28,100,158,163,189,209,267,275,295,300,308,314,317,349,405,427,451],"obtain":[29],"a":[30,40,63,87,101,127,336,372,376,438],"joint":[31],"path,":[33],"then,":[34],"latter":[36],"parametrized":[38],"with":[39,120,183,437],"time":[41,263,282,447,466],"law.":[42],"If":[43],"processes":[46],"are":[47,130,206,410],"separated,":[48],"they":[49],"cannot":[50],"optimize":[51,164,309],"same":[53,240],"objective":[54,83,298],"function,":[55],"ultimately":[56],"providing":[57,86],"sub-optimal":[58],"results.":[59,185],"In":[60,359],"this":[61],"paper,":[62],"unified":[64],"approach":[65],"presented":[67],"where":[68,408,422],"dynamic":[69,328,434],"programming":[70,435],"underlying":[73,433],"optimization":[74],"technique.":[75],"Its":[76],"flexibility":[77],"allows":[78],"accommodating":[79],"arbitrary":[80],"constraints":[81,294],"and":[82,141,172,262,297,356,370,379,388,484],"functions,":[84],"thus":[85,454],"generic":[88],"framework":[89,106,155],"real":[94,102,128,181,377],"systems.":[95],"To":[96],"demonstrate":[97],"its":[98,272],"applicability":[99,402],"world":[103],"scenario,":[104],"instantiated":[108],"time-optimality":[110],"on":[111,126,180,231,326,375],"Franka":[112],"Emika\u2019s":[113],"Panda":[114],"robot.":[115],"The":[116,149,287],"well-known":[117],"issues":[118],"associated":[119],"execution":[122,281],"non-smooth":[124],"controller":[129],"partially":[131,142],"addressed":[132],"at":[133,169,271],"level,":[135],"through":[136,143,364],"enforcement":[138],"constraints,":[140],"post-processing":[144],"solution.":[148],"experiments":[150],"show":[151],"that":[152,176,460],"proposed":[154],"able":[157],"effectively":[159],"exploit":[160,211],"kinematic":[161],"redundancy":[162],"performance":[166,485],"index":[167],"defined":[168,248],"level":[171],"generate":[173],"feasible":[174],"can":[177,304,343,461],"be":[178,305,344,449,452,462],"executed":[179],"hardware":[182],"satisfactory":[184],"<italic":[186],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[187],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Note":[188],"Practitioners</i>":[190],"\u2014The":[191],"common":[192],"algorithms":[194],"which":[195],"consolidated":[196],"over":[197],"years":[199],"generating":[201],"non-redundant":[204],"not":[207,417],"adequate":[208],"fully":[210],"more":[213],"advanced":[214],"capabilities":[215],"offered":[216],"by":[217,346],"robots.":[219],"This":[220,342],"especially":[222],"true":[223],"in":[224,234,252,291,394,464],"performance-demanding":[225],"tasks,":[226],"as":[227,266,385,442],"employed":[230],"assembly":[232,244],"lines":[233],"manufacturing":[235],"industries,":[236],"repeatedly":[237],"performing":[238],"activity.":[241],"Once":[242],"line":[245],"engineer":[246],"has":[247,426],"tool":[250],"space,":[255],"our":[256,360,396],"algorithm":[258,288,397],"unifies":[259],"inverse":[260],"kinematics":[261],"parametrization":[264],"so":[265],"bring":[268],"manipulator":[270],"physical":[273],"limits":[274],"achieve":[276,350],"specific":[277],"efficiency":[278,312,355],"goals,":[279],"being":[280],"most":[284,457],"typical":[285],"one.":[286],"configurable":[290],"terms":[292],"consider":[296],"functions":[299],"optimize,":[301],"therefore":[302],"it":[303,415],"easily":[306],"adapted":[307],"other":[310],"custom-defined":[311],"indices,":[313],"better":[315],"respond":[316],"needs":[319],"automation":[322],"plant.":[323],"Being":[324],"based":[325],"discrete":[327],"programming,":[329],"global":[331],"optimum":[332],"guaranteed":[334],"given":[337],"resolution":[338],"problem.":[341],"configured":[345],"operator":[348],"desired":[352],"trade-off":[353],"between":[354],"time.":[358],"experiments,":[361],"we":[362],"go":[363],"whole":[366],"process":[367],"executing":[371],"time-optimal":[373],"trajectory":[374,386],"robot,":[378],"discuss":[380],"some":[381],"practical":[382],"details,":[383],"such":[384,441],"smoothness":[387],"actuator":[389],"saturation,":[390],"aiding":[391],"practitioners":[393],"deploying":[395],"effectively.":[398],"Currently,":[399],"algorithm\u2019s":[401],"limited":[404],"those":[406,420],"cases":[407,421],"hours":[409],"available":[411,467],"planning,":[413],"hence":[414],"well-suited":[418],"robot":[424],"activity":[425],"change":[428],"frequently.":[429],"By":[430],"replacing":[431],"engine":[436],"different":[439],"methodology,":[440],"randomized":[443],"algorithms,":[444],"could":[448],"controlled":[450],"upper-bounded,":[453],"returning":[455],"efficient":[458],"solution":[459],"achieved":[463],"reconfiguring":[469],"production.":[471],"Other":[472],"applications":[473],"interest":[475],"include":[476],"ground":[478],"control":[479],"robotic":[482],"assets":[483],"benchmarking":[486],"online":[488],"algorithms.":[490]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}