default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNir Lipovetzky
Person information
- affiliation: University of Melbourne, School of Computing and Information Systems, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Zihang Su
, Artem Polyvyanyy, Nir Lipovetzky, Sebastian Sardiña, Nick van Beest:
Adaptive goal recognition using process mining techniques. Eng. Appl. Artif. Intell. 133: 108189 (2024)- [c44]Chao Lei, Nir Lipovetzky, Krista A. Ehinger:
Generalized Planning for the Abstraction and Reasoning Corpus. AAAI 2024: 20168-20175 - [c43]Todd W. Neller, Pia Bideau, David Bierbach, Wolfgang Hönig, Nir Lipovetzky, Christian Muise, Lino Coria, Claire Wong, Stephanie Rosenthal, Yu Lu, Ming Gao, Jingjing Zhang:
Model AI Assignments 2024. AAAI 2024: 23370-23371 - [c42]Chenyuan Zhang, Charles Kemp, Nir Lipovetzky:
Human Goal Recognition as Bayesian Inference: Investigating the Impact of Actions, Timing, and Goal Solvability. AAMAS 2024: 2066-2074 - [c41]Giacomo Rosa, Nir Lipovetzky:
Count-Based Novelty Exploration in Classical Planning. ECAI 2024: 4181-4189 - [c40]Qingtan Shen, Artem Polyvyanyy, Nir Lipovetzky, Timotheus Kampik:
Agent System Event Data: Concepts, Dimensions, Applications. ER 2024: 56-72 - [i18]Chao Lei, Nir Lipovetzky, Krista A. Ehinger:
Generalized Planning for the Abstraction and Reasoning Corpus. CoRR abs/2401.07426 (2024) - [i17]Chenyuan Zhang, Charles Kemp, Nir Lipovetzky:
Human Goal Recognition as Bayesian Inference: Investigating the Impact of Actions, Timing, and Goal Solvability. CoRR abs/2402.10510 (2024) - [i16]Giacomo Rosa, Nir Lipovetzky:
Count-based Novelty Exploration in Classical Planning. CoRR abs/2408.13719 (2024) - [i15]Sukai Huang, Nir Lipovetzky, Trevor Cohn:
Planning in the Dark: LLM-Symbolic Planning Pipeline without Experts. CoRR abs/2409.15915 (2024) - [i14]Sukai Huang, Nir Lipovetzky, Trevor Cohn:
Overcoming Reward Model Noise in Instruction-Guided Reinforcement Learning. CoRR abs/2409.15922 (2024) - 2023
- [j9]Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Width-based search for multi agent privacy-preserving planning. Artif. Intell. 318: 103883 (2023) - [j8]Zihang Su, Artem Polyvyanyy, Nir Lipovetzky, Sebastian Sardiña, Nick van Beest:
Fast and accurate data-driven goal recognition using process mining techniques. Artif. Intell. 323: 103973 (2023) - [j7]Elena M. Vella, Airlie Chapman, Nir Lipovetzky:
Learning User Preferences for Complex Cobotic Tasks: Meta-Behaviors and Human Groups. IEEE Robotics Autom. Lett. 8(7): 4123-4130 (2023) - [c39]Guang Hu, Tim Miller, Nir Lipovetzky:
Planning with Multi-Agent Belief Using Justified Perspectives. ICAPS 2023: 180-188 - [c38]Chenyuan Zhang, Charles Kemp, Nir Lipovetzky:
Goal Recognition with Timing Information. ICAPS 2023: 443-451 - [c37]Chenyuan Zhang, Nir Lipovetzky, Charles Kemp:
Comparing AI Planning Algorithms with Humans on the Tower of London Task. CogSci 2023 - [c36]Lyndon Benke, Tim Miller, Michael Papasimeon, Nir Lipovetzky:
Diverse, Top-k, and Top-Quality Planning Over Simulators. ECAI 2023: 231-238 - [c35]Zihang Su, Tianshi Yu, Nir Lipovetzky, Alireza Mohammadi, Denny Oetomo, Artem Polyvyanyy, Sebastian Sardiña, Ying Tan, Nick van Beest:
Data-Driven Goal Recognition in Transhumeral Prostheses Using Process Mining Techniques. ICPM 2023: 25-32 - [c34]Chao Lei, Nir Lipovetzky, Krista A. Ehinger:
Novelty and Lifted Helpful Actions in Generalized Planning. SOCS 2023: 148-152 - [i13]Sukai Huang, Nir Lipovetzky, Trevor Cohn:
A Reminder of its Brittleness: Language Reward Shaping May Hinder Learning for Instruction Following Agents. CoRR abs/2305.16621 (2023) - [i12]Chao Lei, Nir Lipovetzky, Krista A. Ehinger:
Novelty and Lifted Helpful Actions in Generalized Planning. CoRR abs/2307.00735 (2023) - [i11]Anubhav Singh, Miquel Ramírez, Nir Lipovetzky, Peter J. Stuckey:
Lifted Sequential Planning with Lazy Constraint Generation Solvers. CoRR abs/2307.08242 (2023) - [i10]Lyndon Benke, Tim Miller, Michael Papasimeon, Nir Lipovetzky:
Diverse, Top-k, and Top-Quality Planning Over Simulators. CoRR abs/2308.13147 (2023) - [i9]Zihang Su, Tianshi Yu, Nir Lipovetzky, Alireza Mohammadi, Denny Oetomo, Artem Polyvyanyy, Sebastian Sardiña, Ying Tan, Nick van Beest:
Data-Driven Goal Recognition in Transhumeral Prostheses Using Process Mining Techniques. CoRR abs/2309.08106 (2023) - 2022
- [j6]Guang Hu, Tim Miller, Nir Lipovetzky:
Planning with Perspectives - Decomposing Epistemic Planning using Functional STRIPS. J. Artif. Intell. Res. 75: 489-539 (2022) - [j5]Hai Ho Dac, Claudia Gonzalez Viejo, Nir Lipovetzky, Eden Jane Tongson, Frank R. Dunshea, Sigfredo Fuentes:
Livestock Identification Using Deep Learning for Traceability. Sensors 22(21): 8256 (2022) - [c33]Zihang Su, Artem Polyvyanyy, Nir Lipovetzky, Sebastian Sardiña, Nick van Beest:
GRACE: A Simulator for Continuous Goal Recognition over Changing Environments. PMAI@IJCAI 2022: 37-48 - [c32]Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract). SOCS 2022: 276-278 - [c31]Stefan O'Toole, Miquel Ramírez, Nir Lipovetzky, Adrian R. Pearce:
Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract). SOCS 2022: 308-310 - [i8]Stefan O'Toole, Miquel Ramírez, Nir Lipovetzky, Adrian R. Pearce:
Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning. CoRR abs/2207.03336 (2022) - 2021
- [j4]Grady Fitzpatrick, Nir Lipovetzky, Michael Papasimeon, Miquel Ramírez, Mor Vered:
Behaviour Recognition with Kinodynamic Planning Over Continuous Domains. Frontiers Artif. Intell. 4: 717003 (2021) - [j3]Sigfredo Fuentes, Claudia Gonzalez Viejo, Eden Jane Tongson, Nir Lipovetzky, Frank R. Dunshea:
Biometric Physiological Responses from Dairy Cows Measured by Visible Remote Sensing Are Good Predictors of Milk Productivity and Quality through Artificial Intelligence. Sensors 21(20): 6844 (2021) - [c30]Chao Lei, Nir Lipovetzky:
Width-Based Backward Search. ICAPS 2021: 219-224 - [c29]Anubhav Singh, Nir Lipovetzky, Miquel Ramírez, Javier Segovia-Aguas:
Approximate Novelty Search. ICAPS 2021: 349-357 - [c28]Nir Lipovetzky:
Width-Based Algorithms for Common Problems in Control, Planning and Reinforcement Learning. IJCAI 2021: 4956-4960 - [c27]Stefan O'Toole, Nir Lipovetzky, Miquel Ramírez, Adrian R. Pearce:
Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark. NeurIPS 2021: 26536-26547 - [i7]Anubhav Singh, Nir Lipovetzky, Miquel Ramírez, Javier Segovia-Aguas:
Approximate Novelty Search. CoRR abs/2105.07691 (2021) - [i6]Nir Lipovetzky:
Planning for Novelty: Width-Based Algorithms for Common Problems in Control, Planning and Reinforcement Learning. CoRR abs/2106.04866 (2021) - [i5]Stefan O'Toole, Nir Lipovetzky, Miquel Ramírez, Adrian R. Pearce:
Width-based Lookaheads with Learnt Base Policies and Heuristics Over the Atari-2600 Benchmark. CoRR abs/2106.12151 (2021) - 2020
- [j2]Sigfredo Fuentes, Vasiliki Summerson, Claudia Gonzalez Viejo, Eden Jane Tongson, Nir Lipovetzky, Kerry Wilkinson, Colleen Szeto, Ranjith R. Unnithan:
Assessment of Smoke Contamination in Grapevine Berries and Taint in Wines Due to Bushfires Using a Low-Cost E-Nose and an Artificial Intelligence Approach. Sensors 20(18): 5108 (2020) - [c26]Artem Polyvyanyy, Zihang Su, Nir Lipovetzky, Sebastian Sardiña:
Goal Recognition Using Off-The-Shelf Process Mining Techniques. AAMAS 2020: 1072-1080 - [c25]Florent Teichteil-Königsbuch, Miquel Ramírez, Nir Lipovetzky:
Boundary Extension Features for Width-Based Planning with Simulators on Continuous-State Domains. IJCAI 2020: 4183-4189 - [i4]Gang Chen, Yi Ding, Hugo Edwards, Chong Hin Chau, Sai Hou, Grace Johnson, Mohammed Sharukh Syed, Haoyuan Tang, Yue Wu, Ye Yan, Gil Tidhar, Nir Lipovetzky:
Planimation. CoRR abs/2008.04600 (2020)
2010 – 2019
- 2019
- [b2]Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, Christian Muise:
An Introduction to the Planning Domain Definition Language. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00456-8 - [j1]Nir Lipovetzky, Sebastian Sardiña:
Pacman Capture the Flag in AI Courses. IEEE Trans. Games 11(3): 296-299 (2019) - [c24]Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Best-First Width Search for Multi Agent Privacy-Preserving Planning. ICAPS 2019: 163-171 - [c23]Alfonso Emilio Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Novelty Messages Filtering for Multi Agent Privacy-Preserving Plannin. SOCS 2019: 79-87 - [e1]J. Benton, Nir Lipovetzky, Eva Onaindia, David E. Smith, Siddharth Srivastava:
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2019, Berkeley, CA, USA, July 11-15, 2019. AAAI Press 2019 [contents] - [i3]Guang Hu, Tim Miller, Nir Lipovetzky:
What you get is what you see: Decomposing Epistemic Planning using Functional STRIPS. CoRR abs/1903.11777 (2019) - [i2]Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Best-First Width Search for Multi Agent Privacy-preserving Planning. CoRR abs/1906.03955 (2019) - [i1]Alfonso Emilio Gerevini, Nir Lipovetzky, Nico Peli, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Novelty Messages Filtering for Multi Agent Privacy-preserving Planning. CoRR abs/1906.08061 (2019) - 2018
- [c22]Gabriele Bazzotti, Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Iterative Width Search for Multi Agent Privacy-Preserving Planning. AI*IA 2018: 431-444 - [c21]Miquel Ramírez, Michael Papasimeon, Nir Lipovetzky, Lyndon Benke, Tim Miller, Adrian R. Pearce, Enrico Scala, Mohammad Zamani:
Integrated Hybrid Planning and Programmed Control for Real Time UAV Maneuvering. AAMAS 2018: 1318-1326 - [c20]Aleck M. MacNally, Nir Lipovetzky, Miquel Ramírez, Adrian R. Pearce:
Action Selection for Transparent Planning. AAMAS 2018: 1327-1335 - 2017
- [c19]Nir Lipovetzky, Hector Geffner:
Best-First Width Search: Exploration and Exploitation in Classical Planning. AAAI 2017: 3590-3596 - [c18]Michael Katz, Nir Lipovetzky, Dany Moshkovich, Alexander Tuisov:
Adapting Novelty to Classical Planning as Heuristic Search. ICAPS 2017: 172-180 - [c17]Nir Lipovetzky, Hector Geffner:
A Polynomial Planning Algorithm that Beats LAMA and FF. ICAPS 2017: 195-199 - [c16]Lukás Chrpa, Nir Lipovetzky, Sebastian Sardiña:
Handling non-local dead-ends in Agent Planning Programs. IJCAI 2017: 971-978 - [c15]Guillem Francès, Miquel Ramírez, Nir Lipovetzky, Hector Geffner:
Purely Declarative Action Descriptions are Overrated: Classical Planning with Simulators. IJCAI 2017: 4294-4301 - [c14]Miquel Ramírez, Michael Papasimeon, Lyndon Benke, Nir Lipovetzky, Tim Miller, Adrian R. Pearce:
Real-Time UAV Maneuvering via Automated Planning in Simulations. IJCAI 2017: 5243-5245 - 2016
- [c13]Nir Lipovetzky, Christian J. Muise, Hector Geffner:
Traps, Invariants, and Dead-Ends. ICAPS 2016: 211-215 - [c12]Toby O. Davies, Adrian R. Pearce, Peter J. Stuckey, Nir Lipovetzky:
Sequencing Operator Counts. IJCAI 2016: 4140-4144 - 2015
- [c11]Nir Lipovetzky, Miquel Ramírez, Hector Geffner:
Classical Planning Algorithms on the Atari Video Games. AAAI Workshop: Learning for General Competency in Video Games 2015 - [c10]Toby O. Davies, Adrian R. Pearce, Peter J. Stuckey, Nir Lipovetzky:
Sequencing Operator Counts. ICAPS 2015: 61-69 - [c9]Christina N. Burt, Nir Lipovetzky, Adrian R. Pearce, Peter J. Stuckey:
Scheduling with Fixed Maintenance, Shared Resources and Nonlinear Feedrate Constraints: A Mine Planning Case Study. CPAIOR 2015: 91-107 - [c8]Nir Lipovetzky, Miquel Ramírez, Hector Geffner:
Classical Planning with Simulators: Results on the Atari Video Games. IJCAI 2015: 1610-1616 - 2014
- [c7]Nir Lipovetzky, Christina N. Burt, Adrian R. Pearce, Peter J. Stuckey:
Planning for Mining Operations with Time and Resource Constraints. ICAPS 2014 - [c6]Nir Lipovetzky, Hector Geffner:
Width-based Algorithms for Classical Planning: New Results. ECAI 2014: 1059-1060 - 2013
- [c5]Fabio Patrizi, Nir Lipovetzky, Hector Geffner:
Fair LTL Synthesis for Non-Deterministic Systems using Strong Cyclic Planners. IJCAI 2013: 2343-2349 - 2012
- [b1]Nir Lipovetzky:
Structure and inference in classical planning. Pompeu Fabra University, Spain, 2012 - [c4]Nir Lipovetzky, Hector Geffner:
Width and Serialization of Classical Planning Problems. ECAI 2012: 540-545 - 2011
- [c3]Nir Lipovetzky, Hector Geffner:
Searching for Plans with Carefully Designed Probes. ICAPS 2011 - [c2]Fabio Patrizi, Nir Lipovetzky, Giuseppe De Giacomo, Hector Geffner:
Computing Infinite Plans for LTL Goals Using a Classical Planner. IJCAI 2011: 2003-2008
2000 – 2009
- 2009
- [c1]Nir Lipovetzky, Hector Geffner:
Inference and Decomposition in Planning Using Causal Consistent Chains. ICAPS 2009
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
