-
EP3699832
European procedure
- EP About this file
- EP Legal status
- EP Federated register
- EP Event history
- EP Citations
- EP Patent family
- EP All documents
Extract from the Register of European Patents
EP About this file: EP3699832
| EP3699832 - SYSTEMS AND METHODS FOR OPTIMIZING SCHEDULING OF NON-PREEMPTIVE TASKS IN MULTI-ROBOTIC ENVIRONMENT [Right-click to bookmark this link] | Status | Examination is in progress Status updated on 06.05.2022 Database last updated on 19.10.2024 | |
| Former | Request for examination was made Status updated on 05.03.2021 | ||
| Former | The application has been published Status updated on 24.07.2020 | Most recent event Tooltip | 26.02.2024 | New entry: Renewal fee paid | Applicant(s) | For all designated states Tata Consultancy Services Limited Nirmal Building 9th Floor Nariman Point Mumbai 400 021 Maharashtra / IN | [2020/35] | Inventor(s) | 01 /
Agarwal, Marichi Tata Consultancy Services Limited Block -1B, Eco Space, Plot No. IIF/12 (Old No. AA-II/BLK 3. I.T) Street 59 M. WIDE (R.O.W.) Road, New Town, Rajarhat, P.S. Rajarhat, D 700160 Kolkata - West Bengal / IN | 02 /
Sarkar, Chayan Tata Consultancy Services Limited Block -1B, Eco Space, Plot No. IIF/12 (Old No. AA-II/BLK 3. I.T) Street 59 M. WIDE (R.O.W.) Road, New Town, Rajarhat, P.S. Rajarhat, D 700160 Kolkata - West Bengal / IN | [2020/35] | Representative(s) | Goddar, Heinz J. Boehmert & Boehmert Anwaltspartnerschaft mbB Pettenkoferstrasse 22 80336 München / DE | [2020/35] | Application number, filing date | 20157323.5 | 14.02.2020 | [2020/35] | Priority number, date | IN201921006550 | 19.02.2019 Original published format: IN201921006550 | [2020/35] | Filing language | EN | Procedural language | EN | Publication | Type: | A1 Application with search report | No.: | EP3699832 | Date: | 26.08.2020 | Language: | EN | [2020/35] | Search report(s) | (Supplementary) European search report - dispatched on: | EP | 20.03.2020 | Classification | IPC: | G06Q10/00 | [2020/35] | CPC: |
G06Q10/00 (EP);
B65G1/1373 (US);
G06Q10/06316 (US);
G06Q10/087 (US)
| Designated contracting states | AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LI, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR [2021/14] |
| Former [2020/35] | AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LI, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR | Extension states | BA | Not yet paid | ME | Not yet paid | Validation states | KH | Not yet paid | MA | Not yet paid | MD | Not yet paid | TN | Not yet paid | Title | German: | SYSTEME UND VERFAHREN ZUR OPTIMIERUNG DER PLANUNG VON NICHT PRÄEMPTIVEN AUFGABEN IN EINER MULTI-ROBOTERUMGEBUNG | [2020/35] | English: | SYSTEMS AND METHODS FOR OPTIMIZING SCHEDULING OF NON-PREEMPTIVE TASKS IN MULTI-ROBOTIC ENVIRONMENT | [2020/35] | French: | SYSTÈMES ET PROCÉDÉS DE PROGRAMMATION D'UN ENSEMBLE DE TÂCHES NON PRÉEMPTIVES DANS UN ENVIRONNEMENT MULTI-ROBOT | [2020/35] | Examination procedure | 26.02.2021 | Amendment by applicant (claims and/or description) | 26.02.2021 | Examination requested [2021/14] | 26.02.2021 | Date on which the examining division has become responsible | 06.05.2022 | Despatch of a communication from the examining division (Time limit: M04) | 25.08.2022 | Reply to a communication from the examining division | Fees paid | Renewal fee | 19.01.2022 | Renewal fee patent year 03 | 03.01.2023 | Renewal fee patent year 04 | 26.02.2024 | Renewal fee patent year 05 |
| Opt-out from the exclusive Tooltip competence of the Unified Patent Court | See the Register of the Unified Patent Court for opt-out data | ||
| Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court. | Documents cited: | Search | [I]US2017173784 (SHAH RUCHI RAJAN [IN], et al) [I] 1-15 * paragraph [0002] - paragraph [0047]; figures 1-7; claims 1-3 *; | [I]US2018275679 (BAUGHMAN AARON K [US], et al) [I] 1-15* paragraph [0012] - paragraph [0032]; figures 1-2; claims 1-15 * |